关闭

ICPC2017网络赛(沈阳)1012&HDU6205Card(最大子段和)

标签: dp最大子段和
1422人阅读 评论(0) 收藏 举报
分类:

card card card

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


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 (1n106), denoting n heaps of cards;
next line contains n integers, the ith integer ai (0ai1000) denoting there are ai cards in ith heap;
then the third line also contains n integers, the ith integer bi (1bi1000) denoting the "penalty value" of ith 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]
 

Source
【题意】:

给出一个序列,可以看做是可循环的。然后求出从第几个开始取数,能使得和最大,但是要求取的这m个连续得到数之和,大于他们的惩罚值(即第二行序列)

【解析】:

最大子段和思想,对两序列的差,和第一行系列,同时进行。

【代码】:

#include <stdio.h>
typedef long long ll;
const int MAX=1e6+5;
const int INF=0x3f3f3f3f;
int n,a[3*MAX],b[3*MAX];
int main()
{
	while(~scanf("%d",&n))
	{
		int s=0;
		for(int i=1;i<=n;i++)
		{
			scanf("%d",&a[i]);
			a[i+n]=a[i];
		}
		for(int i=1;i<=n;i++)
		{
			int x;
			scanf("%d",&x);
			b[i]=a[i]-x;
			b[i+n]=b[i];
		}
		int sum=0,suma=0;
		int maxa=-INF;
		int l,r,temp=1;// l  r 可以记录区间
		for(int i=1;i<=2*n;i++)  
		{  
			suma+=a[i];
		    sum+=b[i];
			if(suma>maxa)
			{
				maxa=suma;
		        l=temp;
		        r=i;
			}
		    if(sum<0)//限制了,重来吧 
		    {
		    	suma=0;
		        sum=0;
		        temp=i+1;
		        if(temp>n+1)break;
		    }
		}  
		printf("%d\n",l-1);
	}
	return 0;
}


0
0
查看评论
发表评论
* 以上用户言论只代表其个人观点,不代表CSDN网站的观点或立场

HDU 6205 card card card(展开字符串思想+思维)

As a fan of Doudizhu, WYJ likes collecting playing cards very much. One day, MJF takes a stack of c...
  • qq_37497322
  • qq_37497322
  • 2017-09-10 17:46
  • 660

HDU 6205 card card card

题目地址 题意:给你n堆牌,原本每一堆的所有牌(a[i]张)默认向下,每次从第一堆开始,将固定个数的牌(b[i]张)翻上,然后下一堆继续,直到没有足够的牌翻上,然后你可以获得当前已经操作过的堆的所有...
  • xjh_shin
  • xjh_shin
  • 2017-09-11 00:41
  • 263

2016 acm/icpc 沈阳现场赛题解(5道题,更新ing)

5948.Thickest Burger(签到题)http://acm.hdu.edu.cn/showproblem.php?pid=5948题目大意:给你A和B,问2A+B和2B+A谁大?题目分析:...
  • cmershen
  • cmershen
  • 2016-11-21 21:59
  • 1977

hdu 5514 Frogs 2015沈阳区域赛 数论 欧拉 好题 开心的题

2015沈阳区域赛,现场A的题,银牌题。
  • xc19952007
  • xc19952007
  • 2015-11-01 10:56
  • 1230

2016ACM/ICPC亚洲区沈阳站现场赛题解报告

2016ACM/ICPC亚洲区沈阳站现场赛题解报告
  • queuelovestack
  • queuelovestack
  • 2016-10-30 19:11
  • 2413

hdu 5898 odd-even number 2016ACM/ICPC沈阳赛区网络赛1007

Problem Description For a number,if the length of continuous odd digits is even and the length of c...
  • lqybzx
  • lqybzx
  • 2016-09-18 22:49
  • 572

hdu 5900 QSC and Master -ICPC网络赛沈阳赛区-区间dp

QSC and Master Every school has some legends, Northeastern University is the same. Enter from the no...
  • ly59782
  • ly59782
  • 2016-09-20 15:35
  • 170

hdu 5898 odd even number(acm/icpc沈阳赛区网络赛,数位DP)

传送门: http://acm.hdu.edu.cn/showproblem.php?pid=5898题目大意: 定义odd-even-number是一个数,其中连续奇数位的长度是偶数,连续偶数位的...
  • cmershen
  • cmershen
  • 2016-10-31 16:35
  • 289

hdu5894 hannnnah_j’s Biological Test(2016 acm/icpc 沈阳网络赛,组合数学)

传送门:http://acm.hdu.edu.cn/showproblem.php?pid=5894题目大意:有n张桌子围成一圈,坐m个人,任意相邻两人至少隔k个空位。 座位是各不相同的,m个人是相...
  • cmershen
  • cmershen
  • 2016-11-04 10:11
  • 407

hdu 5900 QSC and Master(acm/icpc沈阳网络赛,区间DP)

传送门: http://acm.hdu.edu.cn/showproblem.php?pid=5900题目大意: 给你一个数组,数组的每个元素是一个二元组,用表示,你每次可以消掉相邻的两个数对,要求...
  • cmershen
  • cmershen
  • 2016-10-31 15:46
  • 206
    个人资料
    • 访问:93046次
    • 积分:2798
    • 等级:
    • 排名:第14775名
    • 原创:185篇
    • 转载:9篇
    • 译文:0篇
    • 评论:33条
    博客专栏
    最新评论