|
card card cardTime Limit: 8000/4000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 439 Accepted Submission(s): 190
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
Sample Output
Source
——————————————————————————————————
题目的意思是有n堆卡,你必须从前往后依次选择每队卡,你可以获得a[i]同时失去b[i],
如果减去b[i]后变负了就停止,此时所有用过的a[i]之和就是你的价值;游戏开始前你可选择前k的按循序挪到最后,问k取多少时价值最大
思路:先把原序列扩充两倍,然后尺取法维护最大值
|
HDU6205 card card card
最新推荐文章于 2022-02-18 17:21:49 发布