2017年2月19日
Codeforces Round #398 D题Cartons of milk（二分，贪心）解题报告
摘要： D. Cartons of milk time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output D. Cartons of milk ti 阅读全文
posted @ 2017-02-19 13:14 perplex 阅读(554) 评论(0) 推荐(0) 编辑
Codeforces Round #398 C题Garland（DFS）解题报告
摘要： C. Garland time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output C. Garland time limit per tes 阅读全文
posted @ 2017-02-19 13:07 perplex 阅读(418) 评论(0) 推荐(0) 编辑
Codeforces Round #398 B题The Queue（贪心）解题报告
摘要： Finally! Vasya have come of age and that means he can finally get a passport! To do it, he needs to visit the passport office, but it's not that simpl 阅读全文
posted @ 2017-02-19 13:02 perplex 阅读(211) 评论(0) 推荐(0) 编辑
2017年2月17日
（线段树、树状数组）poj3468-A Simple Problem with Integers
摘要： You have N integers, A1, A2, ... , AN. You need to deal with two kinds of operations. One type of operation is to add some given number to each number 阅读全文
posted @ 2017-02-17 19:51 perplex 阅读(209) 评论(0) 推荐(0) 编辑
（线段树）hdoj1698-Just a Hook
摘要： In the game of DotA, Pudge’s meat hook is actually the most horrible thing for most of the heroes. The hook is made up of several consecutive metallic 阅读全文
posted @ 2017-02-17 17:52 perplex 阅读(158) 评论(0) 推荐(0) 编辑
（线段树，反素数）poj2886-Who Gets the Most Candies?
摘要： N children are sitting in a circle to play a game. The children are numbered from 1 to N in clockwise order. Each of them has a card with a non-zero i 阅读全文
posted @ 2017-02-17 16:14 perplex 阅读(240) 评论(0) 推荐(0) 编辑
2017年2月15日
（线段树）poj2828-Buy Tickets
摘要： Railway tickets were difficult to buy around the Lunar New Year in China, so we must get up early and join a long queue… The Lunar New Year was approa 阅读全文
posted @ 2017-02-15 21:03 perplex 阅读(197) 评论(0) 推荐(0) 编辑
2017年2月14日
Codeforces Round #397 E题Tree Folding（BFS）解题报告
摘要： E. Tree Folding time limit per test 2 seconds memory limit per test 512 megabytes input standard input output standard output Vanya wants to minimize 阅读全文
posted @ 2017-02-14 23:07 perplex 阅读(369) 评论(0) 推荐(0) 编辑
Codeforces Round #397 D题Artsem and Saunders（构造法）解题报告
摘要： D. Artsem and Saunders time limit per test 2 seconds memory limit per test 512 megabytes input standard input output standard output Artsem has a frie 阅读全文
posted @ 2017-02-14 21:46 perplex 阅读(412) 评论(0) 推荐(1) 编辑
（线段树）hdoj2795-Billboard
摘要： At the entrance to the university, there is a huge rectangular billboard of size h*w (h is its height and w is its width). The board is the place wher 阅读全文
posted @ 2017-02-14 15:59 perplex 阅读(202) 评论(0) 推荐(0) 编辑