ZOJ-3897-Fiddlesticks

题目链接

<span style="font-size:18px;"># include <cstdio>
# include <iostream>
using namespace std;

int e[1100];

int main()
{
    int t;
    scanf("%d",&t);
    while(t--){
        int n,c,x = 0,ans;
        scanf("%d%d",&n,&c);
        for(int i = 1;i <= n;i++)   scanf("%d",&e[i]);
        int sum = n + 5,index = 1;
        while(x != n && sum){
            for(; sum ;index ++){
                sum --;
                index = index % n;
                if(index == 0)    index = n;

                while(e[index] <= 0){
                    index = (index + 1) % n;
                    if(index == 0)    index = n;
                }
                e[index] -= c;
                if(e[index] <= 0 ){
                    x++;
                    if(x == n || sum == 0)    printf("%d\n",index);
                    index--;    break;
                }
                else if(sum == 0)   printf("%d\n",index);
                if(index == n)  index = 0;
            }
            for(; sum ;index --){
                sum--;
                index = index % n;
                if(index == 0)    index = n;
                while(e[index] <= 0){
                    index = (index - 1 + n) % n;
                    if(index == 0)    index = n;
                }
                e[index] -= c;
                if(e[index] <= 0){
                    x ++;
                    if(x == n || sum == 0)   printf("%d\n",index);
                    index++;    break;
                }
                else if(sum == 0)   printf("%d\n",index);
                if(index == 1)  index = n + 1;
            }
        }
    }
    return 0;
}</span>