- 博客(53)
- 收藏
- 关注
原创 UVa 11384 Help is needed for Dexter
分析题目以后得出,对于一个连续等差递增的序列,例如1,2,3,4,5,6,每次选择其中后一半,减去能减的最大数,则是最优操作。上述序列经过一次操作后变为1,2,3,0,1,2,此时可抛弃后一半(已经能和前一半一起处理了),操作前三个数的后两个,以此类推,总共三次操作可把所有数减成0分析得到递推式:设n为序列长度,ans(n)=ans(n/2)+1于是代码变得很简单了:
2016-05-09 23:19:30
452
原创 POJ 1840 Eqs
EqsTime Limit: 5000MS Memory Limit: 65536KTotal Submissions: 15010 Accepted: 7366DescriptionConsider equations having the following form: a1x13+ a2x23+ a3x3
2016-05-03 18:17:16
308
原创 POJ2001 Shortest Prefixes
DescriptionA prefix of a string is a substring starting at the beginning of the given string. The prefixes of "carbon" are: "c", "ca", "car", "carb", "carbo", and "carbon". Note that the empty str
2016-05-02 19:31:14
409
原创 HDU 1166 敌兵布阵
敌兵布阵Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 70734 Accepted Submission(s): 29632Problem DescriptionC国的死对头A国这段时间正在进行军事演习,所以
2016-05-01 21:24:11
571
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人