ACM_树状数组
文章平均质量分 83
RaAlGhul
这个作者很懒,什么都没留下…
展开
-
集训队专题(9)1001 敌兵布阵
敌兵布阵Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 66927 Accepted Submission(s): 28200Problem DescriptionC国的死对头A国这段时间正在进行军事演原创 2016-03-11 13:17:24 · 641 阅读 · 0 评论 -
集训队专题(9)1002 Color the ball
Color the ballTime Limit: 9000/3000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 14633 Accepted Submission(s): 7309Problem DescriptionN个气球排成一排,从原创 2016-03-11 13:28:54 · 540 阅读 · 0 评论 -
集训队专题(9)1003 Frosh Week
Frosh WeekTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2565 Accepted Submission(s): 851Problem DescriptionDuring Frosh Wee原创 2016-03-11 14:22:39 · 618 阅读 · 0 评论 -
集训队专题(9)1004 See you~
See you~Time Limit: 5000/3000 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 4414 Accepted Submission(s): 1396Problem DescriptionNow I am leaving原创 2016-03-11 14:31:44 · 556 阅读 · 0 评论 -
集训队专题(9)1005 Stars
StarsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 7307 Accepted Submission(s): 2875Problem DescriptionAstronomers often ex原创 2016-03-11 14:44:36 · 428 阅读 · 0 评论 -
集训队专题(9)1006 MooFest
MooFestTime Limit : 2000/1000ms (Java/Other) Memory Limit : 60000/30000K (Java/Other)Total Submission(s) : 32 Accepted Submission(s) : 16Problem DescriptionEvery year, Farmer John'原创 2016-03-12 11:49:30 · 1094 阅读 · 0 评论 -
HDOJ 2227 Find the nondecreasing subsequences
Find the nondecreasing subsequencesTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1791 Accepted Submission(s): 655Problem Descr原创 2016-03-14 19:38:13 · 384 阅读 · 0 评论 -
HDOJ 5792 (2016多校联合训练 Training Contest 5) World is Exploding
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=5792题意,给我们n个数的序列A,问我们能够找到多少四个不同位置a,b,c,d的数满足:a≠b≠c≠d,1≤aAd.这题很明显可以用到容斥原理去处理,我们可以先找到所有的情况然后我们再去减去多余的部分即可,算总个数显然就是所有的上升序列个数*所有的下降序列的个数。仔细思考,我们多余的是哪原创 2016-08-05 18:17:45 · 597 阅读 · 0 评论