HDU 6205 card card card

card card card

Time Limit: 8000/4000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 1317    Accepted Submission(s): 598

Problem Description

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.

 

Input

There are about  10  test cases ending up with EOF.
For each test case:
the first line is an integer  n  ( 1≤n≤106 ), denoting  n  heaps of cards;
next line contains  n  integers, the  i th  integer  ai  ( 0≤ai≤1000 ) denoting there are  ai  cards in  i th  heap;
then the third line also contains  n  integers, the  i th  integer  bi  ( 1≤bi≤1000 ) denoting the "penalty value" of  i th  heap is  bi .

 

Output

For each test case, print only an integer, denoting the number of piles WYJ needs to move before the game starts. If there are multiple solutions, print the smallest one.

 

Sample Input

  
  

   
   5
4 6 2 8 4
1 5 7 9 2
  
  

 

Sample Output

  
  

   
   4

   
   

    
    

     
     Hint
    
    
[pre]
For the sample input:

+ If WYJ doesn't move the cards pile, when the game starts the state of cards is:
	4 6 2 8 4
	1 5 7 9 2
WYJ can take the first three piles of cards, and during the process, the number of face-up cards is 4-1+6-5+2-7. Then he can't pay the the "penalty value" of the third pile, the game ends. WYJ will get 12 cards.
+ If WYJ move the first four piles of cards to the end, when the game starts the state of cards is:
	4 4 6 2 8
	2 1 5 7 9
WYJ can take all the five piles of cards, and during the process, the number of face-up cards is 4-2+4-1+6-5+2-7+8-9. Then he takes all cards, the game ends. WYJ will get 24 cards.

It can be improved that the answer is 4.

**huge input, please use fastIO.**
[/pre]

   
   
   
    
  
  

 

题意

 

    给了我们两个数组，第一个数组对应的值减去第二个数组对应值得到一个新的值，这些值组成一个新的数组保证这个数组的值加和等于0，现在我们从第一个数开始加和，如果出现了加和小于零，抱歉，不行，但是你可以移动这些值，你可以把第一个移动到最后一个，问你最少需要移动的次数

解题思路

  

   队友跟我说完题意之后我第一个想到的就是前缀和，我需要找到在哪一步前缀和小于零了，那么我就需要判断一下，在这里移动前面所有的数字可不可以

代码

#include <iostream>
#include <cstring>
#include <algorithm>
#include <cstdio>
using namespace std ;
const int maxn = 1000000 + 10 ;
int a[maxn] , b [maxn] ;
int sum[maxn] ;
int main()
{
    int n ;
    while(scanf("%d" , &n) != EOF)
    {
        memset(sum , 0 , sizeof(sum)) ;
        for(int i = 1 ; i <= n ;i++)  scanf("%d" , &a[i]) ;
        for(int i = 1 ; i <= n ;i++)  scanf("%d" , &b[i]) ;
        int head = n + 1, tail = n + 1;
        int flag = 1 ;
        sum[0] = 0 ;
        int ans = 0 ;
        int pre= 0 ;
        for(int i = 1 ; i <= n ;i++)
        {
            sum[i] = sum[i-1] + (a[i] - b[i]) ;
            if(sum[i] < 0 && i < n)
            {
                int tt = sum[i] + a[i+1] - b[i+1] ;
                if((a[i+1] - b[i+1]) >= 0 && sum[i] - sum[pre] < 0)
                {
                    ans = i ;
                    pre = i ;
                }
            }
        }
       cout<< ans <<endl ;
    }
    return 0 ;
}