UVa10000 - Longest Paths(为什么是WA)

/**** 用dfs并且用了剪枝，为什么还是WA*/
#include <iostream>
#include <fstream>
#include <cstring>
#include <cstdio>using namespace std;const int N = 110;int g[N][N];
bool vis[N];
int n;
int step, dest;
int length[N];void dfs(int s, int dep);int main() {int s;int p, q;int t = 1;#if 0
#ifndef ONLINE_JUDGEfreopen("d:\\OJ\\uva_in.txt", "r", stdin);
#endif
#endifwhile (scanf("%d", &n) == 1) {if (n == 0)break;scanf("%d", &s);memset(g, 0x00, sizeof(g));while (scanf("%d%d", &p, &q) == 2) {if (p == 0 && q == 0)break;g[p][q] = 1;}memset(vis, false, sizeof(vis));memset(length, 0, sizeof(length));step = -1;dest = s;vis[s] = true;dfs(s, 0);#if 0int m = 0;int index = 0;for (int i = 1; i <= n; i++) {if (length[i] > m) {m = length[i];index = i;}}
#endifprintf("Case %d: The longest path from %d has length %d, finishing at %d.\n\n",t++, s, step, dest);}return 0;
}void dfs(int s, int dep) {for (int i = 1; i <= n; i++) {if (g[s][i] && !vis[i]) {vis[i] = true;if (dep + 1 > length[i]) {length[i] = dep + 1;dfs(i, dep + 1);}vis[i] = false;}}if (dep > step) {step = dep;dest = s;}
}

UVa10000 - Longest Paths(为什么是WA)相关推荐

Cow Contest POJ - 3660 And Longest Paths UVA - 10000(弗洛伊德的应用)
Problem Description N ( 1 ≤ N ≤ 100 ) N (1 ≤ N ≤ 100) N(1≤N≤100) cows, conveniently numbered 1.. N 1 ...
UVa10000_Longest Paths(最短路SPFA)
解题报告求最长路. 用SPFA求最长路,初始化图为零,dis数组也为零 #include <iostream> #include <cstdio> #include < ...
2016 10 26考试 NOIP模拟赛杂题
Time 7:50 AM -> 11:15 AM 感觉今天考完后,我的内心是崩溃的试题考试包 T1: 首先看起来是个贪心,然而,然而,看到那个100%数据为n <= 2000整个人就虚 ...
Paper：2017年的Google机器翻译团队《Transformer：Attention Is All You Need》翻译并解读
Paper:2017年的Google机器翻译团队<Transformer:Attention Is All You Need>翻译并解读目录论文评价 1.Motivation: 2.创 ...
ICPC-图论知识与算法要览
1.图定义(Definitions in graph theory) 1)图(Graph) 2)有向图(Directed graph) 3)图数据表示邻接矩阵(Adjacency Matrix),邻 ...
Competitive Programming 3题解
题目一览: Competitive Programming 3: The New Lower Bound of Programming Contests(1) Competitive Programm ...
π-Algorithmist分类题目（3）
原题网站:Algorithmist,http://www.algorithmist.com/index.php/Main_Page π-Algorithmist分类题目(3) Probability ...
π-Algorithmist分类题目（2）
原题网站:Algorithmist,http://www.algorithmist.com/index.php/Main_Page π-Algorithmist分类题目(2) Set Theory U ...
数据结构与算法学习笔记（中）
油管上的CS61B的视频学习代码随看随记 Dijkstra's algorithm再理解 Asymptotics 本意是渐近的意思:这里代指当参数为无穷大时,所需要进行运算的次数,和我们常说的复杂 ...

UVa10000 - Longest Paths(为什么是WA)

UVa10000 - Longest Paths(为什么是WA)相关推荐

最新文章

热门文章