B-fixed points

Description
A permutation of length n is an integer sequence such that each integer from 0 to (n - 1) appears exactly once in it. For example, sequence [0, 2, 1] is a permutation of length 3 while both [0, 2, 2] and [1, 2, 3] are not.
A fixed point of a function is a point that is mapped to itself by the function. A permutation can be regarded as a bijective function. We'll get a definition of a fixed point in a permutation. An integer i is a fixed point of permutation a0, a1, ..., an - 1 if and only if ai = i. For example, permutation [0, 2, 1] has 1 fixed point and permutation [0, 1, 2] has 3 fixed points.
You are given permutation a. You are allowed to swap two elements of the permutation at most once. Your task is to maximize the number of fixed points in the resulting permutation. Note that you are allowed to make at most one swap operation.
Input
The first line contains a single integer n(1 ≤ n ≤ 105). The second line contains n integers a0, a1, ..., an - 1 — the given permutation.
Output
Print a single integer — the maximum possible number of fixed points in the permutation after at most one swap operation.
Sample Input
Input
5
0 1 3 4 2
Output

3

题意描述：

有一组数据，让你交换其中两个数，而且只能交换一次，求其中 a[i]=i的最多的个数。

解题思路：

运用数组存放数据，输入数据，如果a[i]=i则+1,然后交换之后，只有两种情况，即交换的两个数有一个满足a[i]=i和两个都符合，即在原来的和的基础上判断是加一还是加二即可。

解题细节：

注意几个特殊的，即所有数都满足时，还要注意判断加一还是加二的方法，如果满足 a[a[i]]=i;则加二，否则加一！本题的关键就是a[a[i]]的使用！

代码：

#include <iostream>
#include <cstdio>
#include <cmath>
using namespace std;
const int m=100001;
int main()
{
    int i,n,k,sum=0;
    int a[m];
    while(cin>>n)
    {
        sum=0;
        k=0;
     for(i=0;i<n;i++)
     {
         cin>>a[i];
         if(a[i]==i)
         sum++;
     }
     if(sum==n)
     {
         cout<<n<<endl;
     continue;
     }
     for(i=0;i<n;i++)
     {
         if(a[i]!=i)
         {
             if(a[a[i]]==i)
             {
                 k=1;
                 break;
                 }
         }
     }
if(k==1)
cout<<sum+2<<endl;
else cout<<sum+1<<endl;
    }
    return 0;
}

心得：

发现自己还有很多不足之处，应该多做题，多积累做题方法！