iframe-proxy | Sunbelt Computer Software

31 lines (30 loc) · 700 Bytes

//g++ 4.7.2 提交
#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
    scanf("%d", &n);
    int a[n+1], count[n+1];
    memset(count, 0, sizeof(count));
    for (int i = 1; i <= n; ++i)
        scanf("%d", &a[i]);
    for (int i = 1; i <= n; ++i)            
        int t  = (i-a[i]+n+1)%n;   //for循环里可以直接++count[((i - a[i] + 1) % N + N) % N]
        if (t == 0)
           t = n;
        ++count[t];
    int maxnum = 0, maxindex;
    for (int i = 1; i <= n; ++i)
        if (count[i] > maxnum)
            maxnum = count[i];
            maxindex = i;
    printf("%d\n", maxindex);
    return 0;

Sunbelt Computer Software

PL/B Language Development and Support

Provide feedback

Saved searches

Use saved searches to filter your results more quickly

Uh oh!

Sunbelt Computer Software

PL/B Language Development and Support

Uh oh!

FilesExpand file tree

test.cpp

Latest commit

History

test.cpp

File metadata and controls