code forces 996BWorld Cup

B. World Cup

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

Allen wants to enter a fan zone that occupies a round square and has $\mathrm{nn entrances.}$

There already is a queue of ${\mathrm{aiai people\; in\; front\; of\; the ii-th\; entrance.\; Each\; entrance\; allows\; one\; person\; from\; its\; queue\; to\; enter\; the\; fan\; zone\; in\; one\; minute.}}^{}$

Allen uses the following strategy to enter the fan zone:

• Initially he stands in the end of the queue in front of the first entrance.
• Each minute, if he is not allowed into the fan zone during the minute (meaning he is not the first in the queue), he leaves the current queue and stands in the end of the queue of the next entrance (or the first entrance if he leaves the last entrance).

Determine the entrance through which Allen will finally enter the fan zone.

Input

The first line contains a single integer $\mathrm{nn (2\le n\le 1052\le n\le 105) —\; the\; number\; of\; entrances.}$

The second line contains $\mathrm{nn integers a1,a2,\dots ,ana1,a2,\dots ,an (0\le ai\le 1090\le ai\le 109) —\; the\; number\; of\; people\; in\; queues.\; These\; numbers\; do\; not\; include\; Allen.}$

Output

Print a single integer — the number of entrance that Allen will use.

Examples

input

Copy

4
2 3 2 0

output

Copy

3

input

Copy

2
10 10

output

Copy

1

input

Copy

6
5 2 6 5 7 4

output

Copy

6

Note

In the first example the number of people (not including Allen) changes as follows: $[2,3,2,0]\to [1,2,1,0]\to [0,1,0,0][2,3,2,0]\to [1,2,1,0]\to [0,1,0,0].\; The\; number\; in\; bold\; is\; the\; queue\; Alles\; stands\; in.\; We\; see\; that\; he\; will\; enter\; the\; fan\; zone\; through\; the\; third\; entrance.$

In the second example the number of people (not including Allen) changes as follows:$[10,10]\to [9,9]\to [8,8]\to [7,7]\to [6,6]\to [5,5]\to [4,4]\to [3,3]\to [2,2]\to [1,1]\to [0,0][10,10]\to [9,9]\to [8,8]\to [7,7]\to [6,6]\to [5,5]\to [4,4]\to [3,3]\to [2,2]\to [1,1]\to [0,0].$

In the third example the number of people (not including Allen) changes as follows:$[5,2,6,5,7,4]\to [4,1,5,4,6,3]\to [3,0,4,3,5,2]\to [2,0,3,2,4,1]\to [1,0,2,1,3,0]\to [0,0,1,0,2,0][5,2,6,5,7,4]\to [4,1,5,4,6,3]\to [3,0,4,3,5,2]\to [2,0,3,2,4,1]\to [1,0,2,1,3,0]\to [0,0,1,0,2,0].$

 题解：这个题是一个模拟题，问有n个队伍，你不想排队，每次只能走到下一个队伍

请问你在哪个队伍可以不用排队

首先我们可以想到，第一遍走的情况，从头到尾，

那么第一遍模拟就可以是   for（int i =0 ；i<n;i++) a[i]-=i;

这里就有问题了 如果第一遍走不完怎么办 继续从最后一个走到第一个 ，这是一个类似于环一样的

可是我们第一遍模拟的时候只考虑了走后面的情况，走过前面的需要还原，所以我们这里倒着减一下，

使得走一遍后保证每个队伍都走了n个单位长度

那么这里有问题了  如果n特别小但是a[i]特别大呢 

我们有两个优化的地方

1.找出a[i]的最小值,每个都减去min

2.由于a[i]<1e9,n<=1e5，那么在n的循环里面循环20次就可以满足至少出现一个空队列的情况

代码如下

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn= 1e5+5;
const int INF = 0x3f3f3f3f;
ll a[maxn];
int main() {
    int n;
    while(~scanf("%d",&n)) {
        int ans=0;
        int minn=INF;
        for(int i=0; i<n; i++) {
            scanf("%lld",&a[i]);
            if(a[i]<minn) minn=a[i];
        }
        int cnt=minn/n;
        //优化1
        for(int i=0; i<n ; i++) {
            a[i]-=cnt*n;
        }
        //优化2
        for(int d=1; d<=20; d++) {
            for(int i=0; i<n; i++) {
                a[i]-=i;
                if(a[i]<=0) {
                    cout<<i+1<<endl;
                    return 0;
                }
            }
            //还原
            for(int i=n-1;i>=0;i--) {
                a[i] -= n - i;
            }
        }
    }
    return 0;
}