Codeforces Beta Round #87 (Div. 2 Only) C. Party
2013-09-26 12:45
344 查看
# include <stdio.h> int main () { int i,m,n,sum,max=1,q; int a[2005]; scanf("%d",&n); for(i=1;i<=n;i++) { scanf("%d",&a[i]); } for(i=1;i<=n;i++) { // printf("%d ",i); sum=1; q=a[i]; while(q!=-1) { q=a[q]; sum++; } if(sum>max) max=sum; } printf("%d\n",max); return 0; }
这题找的是最长的序列的长度 全是链式图
相关文章推荐
- Codeforces Beta Round #87 (Div. 1 Only)A. Party(深搜/树高)
- Codeforces Beta Round #87 (Div. 1 Only)A. Party(深搜/树高)
- Codeforces Beta Round #73 (Div. 2 Only)——A,B,C
- Codeforces Beta Round #4 (Div. 2 Only)
- Codeforces Beta Round #25 (Div. 2 Only) - E. Test (KMP)
- CSA Round #40 (Div. 2 only)
- Codeforces Beta Round #6 (Div. 2 Only) C. Alice, Bob and Chocolate 水题
- Codeforces Beta Round #4 (Div. 2 Only) D. Mysterious Present 记忆化搜索
- Codeforces Beta Round #75 (Div. 1 Only) B. Queue 线段树。单点更新
- Codeforces Beta Round #83 (Div. 1 Only) E.Darts 凸多边形面积交
- Codeforces Round #437 (Div. 2 C. Ordering Pizza 贪心 only two types of pizza
- 【CS Round #39 (Div. 2 only) A】Removed Pages
- Codeforces Beta Round #85 (Div. 1 Only) C (状态压缩或是数学?)
- Codeforces Beta Round #18 (Div. 2 Only)——A
- Codeforces Beta Round #85 (Div. 1 Only) B. Petya and Divisors 暴力
- Codeforces Beta Round #77 (Div. 1 Only), problem: (C) Volleyball dijstra+heap
- Codeforces Beta Round #80 (Div. 1 Only) D. Time to Raid Cowavans 分块
- Codeforces Beta Round #69 (Div. 2 Only) E题
- 【预处理】Codeforces Beta Round #80 (Div. 1 Only) ——Time to Raid Cowavans
- Codeforces Beta Round #75 (Div. 2 Only)——D