- 博客(6)
- 收藏
- 关注
RSS订阅原创 POJ 1753 Flip Game
Thinking: This one we used the enumeration method. Try the integer from 1 to 2^16 and use bits inside it to imitate different situations. We can have choices on each piece whether we flip it or not si
2016-07-23 18:17:50
268
原创 POJ 2828 Buy Tickets
Thinking: About this question, we have to think reversely. We first get all the input and arrange the sequence from the last guy who enters the queue. Because the last guy will not be effected by p
2016-07-16 15:22:27
310
原创 HDU 2795 Billboard
Thinking: There are 2 tips for this problem. (1) If we use struct , TLE may appear. Instead, I changed to use array maxl[] to store the largest space left in a row in this interval. (2) Since n <=
2016-07-12 12:22:23
256
原创 HDU 1394 Minimum Inversion Number
Thinking: Actually this problem can be solved in a violent way, which is not recommended. Here we made use of segment tree. The basic idea is to save the frequency(actually 0 or 1 for every number) of
2016-07-11 23:17:43
185
原创 UVA 478
Thinking: This is a simple computing geometry problem. But there are some points we need to pay attention to. Like: For triangles, the points that are input are not necessarily in a clockwise or anti-
2016-07-02 16:55:08
605
原创 UVA 211
Thinking: Use dfs to solve this problem. Try all the possibilities row by row. The lay out control is not so clear and you can use udebug to adjust them. AC code:#include #include using nam
2016-07-01 11:09:56
423
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人