Codeforces 201(DIV2)B
来源:互联网 发布:透视手机照相机软件 编辑:程序博客网 时间:2024/06/09 17:07
思路:a[i] = k,且a[k] = i,即i==a[a[i]](k与i不相等)则可增加2,否则若sum!=n,则必增加1.
#include<stdio.h>#include<math.h>int a[100001];int main(){int n,i,sum,flag,flag1,p;while(~scanf("%d",&n)){p = flag = flag1 = sum = 0;for(i = 0;i < n;i ++){scanf("%d",&a[i]);if(i==a[i])sum++;}if(sum!=n)flag1 = 1;for(i = 0;i < n;i ++){if(a[a[i]]==i&&a[i]!=i){flag = 1;break ;}}if(!(flag+flag1))printf("%d\n",sum);if(flag==1){printf("%d\n",sum+2);continue ;}if(flag==0&&flag1==1)printf("%d\n",sum+1);}
0 0
- Codeforces 201(DIV2)B
- Codeforces-273(div2) B. Random Teams
- Codeforces #353(div2)B.Restoring Painting
- codeforces 105 div2 B
- codeforces 148 div2 B
- Codeforces #103 div2 B
- codeforces 257 div2 B
- Codeforces #263 Div2 B
- codeforces #Round354-div2-B
- codeforces #383 (div2) B
- codeforces #120 div2 B. Surrounded
- Codeforces #165 div2 B Multithreading
- codeforces div2 round#231 B
- codeforces div2 round#230 B
- codeforces 260 div2 B题
- codeforces#336 div2 A,B
- Codeforces Round #421(Div2) B
- Codeforces Round #429 (Div2) B
- HDU 1029
- HDU 1102
- 大学感想
- HDU 1049
- HDU 2571
- Codeforces 201(DIV2)B
- Codeforces 202(DIV2)A
- HDU 1062
- HDU 1061
- HDU 2037
- HDU 2082
- Linux 下 vim/Gvim配置
- HDU 3790
- HDU 1312