codeforces 371A K-Periodic Array

   很简单，就是找第i位、i+k位、i+2*k位...........i+m*k位有多少个数字，计算出每个数出现的次数，找到出现最多的数，那么K-Periodic的第K位数肯定是这个了。这样的话需要替换的就是除出现最多的数之外的数了。 

#include <stdio.h>
#include <algorithm>

using namespace std;

int a[105];

int main()
{
    int n, k;
    while (scanf("%d %d", &n, &k) != EOF)
    {
        for (int i = 1; i <= n; i++)
            scanf("%d", &a[i]);
        int x = n/k;
        int ans = 0;
        for (int i = 1; i <= k; i++)
        {
            int m = 0;
            for (int j = i; j <= n; j+= k)
            {
                int cnt = 0;
                for (int l = j; l <= n; l += k)
                {
                    if (a[j] == a[l])
                        cnt++;
                    if (cnt > m)
                        m = cnt;
                }
            }
            ans += (x-m);
        }
        printf("%d\n", ans);
    }
    return 0;
}

        

转载于:https://www.cnblogs.com/xindoo/p/3595011.html