hdu2017沈阳网络赛card（结论水题）

  题面：

As a fan of Doudizhu, WYJ likes collecting playing cards very much.
One day, MJF takes a stack of cards and talks to him: let's play a game and if you win, you can get all these cards. MJF randomly assigns these cards into n heaps, arranges in a row, and sets a value on each heap, which is called "penalty value".
Before the game starts, WYJ can move the foremost heap to the end any times.
After that, WYJ takes the heap of cards one by one, each time he needs to move all cards of the current heap to his hands and face them up, then he turns over some cards and the number of cards he turned is equal to the penaltyvalue .
If at one moment, the number of cards he holds which are face-up is less than the penaltyvalue , then the game ends. And WYJ can get all the cards in his hands (both face-up and face-down).
Your task is to help WYJ maximize the number of cards he can get in the end.So he needs to decide how many heaps that he should move to the end before the game starts. Can you help him find the answer?
MJF also guarantees that the sum of all "penalty value" is exactly equal to the number of all cards.

解法：只要想到从头维护最大值，比如从a0开始能一直加到ai，那么肯定下次维护最大值必然从i+1开始。因为前缀子序列和必然为正，所以后缀子序列的和必然非正。

代码：

#include <iostream>
#include <cstdio>
using namespace std;
const int maxn=1e6+5;
int a[maxn],b[maxn];
int idx,maxnn;
void init(){
    maxnn=0;
    idx=0;
}
int main(){
    int n;
    while (scanf("%d",&n)!=EOF) {
        for (int i=0; i<n; i++) {
            scanf("%d",&a[i]);
        }
        for (int i=0; i<n; i++) {
            scanf("%d",&b[i]);
        }
        init();
        int ans1,ans2,j;
        for (int tid=0;tid<n; tid++) {
            j=0;ans1=0,ans2=0;
            while (ans1>=0&&j<n) {
                j++;
                ans1=ans1+a[(tid+j-1)%n]-b[(tid+j-1)%n];
                ans2=ans2+a[(tid+j-1)%n];
            }
            if (ans2>maxnn) {
                idx=tid;
                maxnn=ans2;
            }
            tid=tid+j-1;
        }
        cout<<idx<<endl;
    }
    return 0;
}