摘要: D. Table with Letters - 2time limit per test2 secondsmemory limit per test256 megabytesinputinput.txtoutputoutput.txtVasya has recently started to learn English. Now he needs to remember how to write English letters. He isn't sure about some of them, so he decided to train a little.He found a sh 阅读全文
posted @ 2012-12-09 01:23 YogyKwan 阅读(294) 评论(0) 推荐(0) 编辑
摘要: A. Boys and Girls模拟:根据B和G的个数大小关系安排顺序B. Physics Practical模拟:对于每一个数,减去比他的一半小的个数得到最后要的个数,再用n减此数C. Text EditorBFS:只有上下移动的时候情况与普通BFS不同D. Table with Letters - 2DP:选定行的范围,再把可以加入的列加入,复杂度O(n^3)E. Printer数据结构:神题附链接,期待以后AChttp://codeforces.com/contest/253/problem/E6Codeforces Round #154 (Div. 2)2243+111608 阅读全文
posted @ 2012-12-09 00:30 YogyKwan 阅读(196) 评论(0) 推荐(0) 编辑
摘要: C. Number Transformationtime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputLittle Petya likes positive integers a lot. Recently his mom has presented him a positive integera. There's only one thing Petya likes more than numbers: playing with lit 阅读全文
posted @ 2012-12-09 00:19 YogyKwan 阅读(500) 评论(0) 推荐(0) 编辑
摘要: A. Little Xor暴力:计算每段的xor值,找最大B. Unsorting Array贪心:根据有无中间值以及最大最小值的位置分情况讨论C. Points on Line模拟:两个指针,一个负责前端,一个负责对应端,因为都是非降序的,故O(n)D. Playing with Permutations模拟:模拟出前后k次的结果,奇偶判断是否能成立E. Number Transformation数论:找到k们的最小公倍数,关键是:若相差大于最小公倍数则中途会经历很多次模最小公倍数为零的情况5Codeforces Round #153 (Div. 2)6141-861597 阅读全文
posted @ 2012-12-09 00:13 YogyKwan 阅读(260) 评论(0) 推荐(0) 编辑