摘要:
这次的A题没注意要到100- -,B题没做,后来做要注意下1和long longC题当时坑的一B,用了个蠢办法,后来还错了,现在改了,还是蠢办法,等等再去用dp吧,而且本来就只有01用个鸡巴的树状数组啊。。。D题利用i+j的和去减掉i然后判断小于步数和n的最小值,初始化为1和步数-m+1的最大值就可以了在判断小于k次,方法比我原来的好xx倍- - 阅读全文
posted @ 2014-02-13 05:35
HaibaraAi
阅读(133)
评论(0)
推荐(0)
摘要:
Sponsored by HaibaraAi | LogoutHomeContestsGymProblemsetGroupsRatingHelpRockethon Codeforces Round #229 (Div. 2)FinishedPractice → PracticeYou are registered for practice. You can solve problems unofficially. Results can be found in the contest status and in the bottom of standings. → Submit? ... 阅读全文
posted @ 2014-02-13 04:41
HaibaraAi
阅读(123)
评论(0)
推荐(0)
浙公网安备 33010602011771号