Codeforces 115A
来源:互联网 发布:阿里云centos ssh 编辑:程序博客网 时间:2024/04/30 07:20
思路:求树的高度。用并查集,不要压缩路径。
#include<iostream>#include<cstdio>#include<cstring>using namespace std;int father[2005], cnt;int max(int x, int y){ return x > y ? x : y;}void init(int n){ for(int i = 1;i <= n;i ++) father[i] = i;}void find(int x){ if(x == father[x]) return; cnt ++; find(father[x]);}void unit(int x, int y){ father[x] = y; return ;}int main(int argc, char const *argv[]) { int n, ans, temp; while(~scanf("%d", &n)) { init(n); for(int i = 1;i <= n;i ++) { scanf("%d", &temp); if(temp != -1) unit(i, temp); } ans = 0; for(int i = 1;i <= n;i ++) { cnt = 0; find(i); ans = max(ans, cnt); } printf("%d\n", ans+1); } return 0;}
0 0
- Codeforces 115A
- CodeForces 115A
- Codeforces 115A- Party
- codeforces-115A-Party
- codeforces 115A
- Codeforces 115A Party
- CodeForces 115A Party
- CodeForces 115A
- Codeforces 115A. Party
- codeforces 115A Party dfs
- Codeforces 115A Party 题解
- CodeForces-a
- Codeforces 903A A
- Codeforces 115A- Party(DFS)
- Codeforces #115 A 树+最大层数
- CodeForces 18A A - Triangle
- CodeForces 133A A. HQ9+
- codeforces 651A A. Joysticks
- Codeforces 283A
- 第二章 在窗口中绘图GDI
- HDU 3635
- Codeforce 340D
- Codeforces 237C
- Codeforces 115A
- POJ 1144
- Codeforces 302D
- Codeforces 14D
- 快速幂取模
- 扩展欧几里德
- 求解欧拉函数值
- 求解n位格雷码
- POJ 3009