- 博客(26)
- 资源 (2)
- 收藏
- 关注
RSS订阅原创 Bad Hair Day（单调栈）
Some of Farmer John's N cows (1 ≤ N ≤ 80,000) are having a bad hair day! Since each cow is self-conscious about her messy hairstyle, FJ wants to count the number of other cows that can see the top of other cows
2017-08-17 11:29:04
598
原创 Equations（Hash）
Consider equations having the following form: a*x1^2+b*x2^2+c*x3^2+d*x4^2=0 a, b, c, d are integers from the interval [-50,50] and any of them cannot be 0. It is consider a solution a system ( x1,x2,x
2017-08-07 16:00:31
566
原创 Flying to the Mars（Hash）
In the year 8888, the Earth is ruled by the PPF Empire . As the population growing , PPF needs to find more land for the newborns . Finally , PPF decides to attack Kscinow who ruling the Mars . Here the probl
2017-08-07 15:54:52
439
原创 The Suspects （并查集）
Severe acute respiratory syndrome (SARS), an atypical pneumonia of unknown aetiology, was recognized as a global threat in mid-March 2003. To minimize transmission to others, the best strategy is to separate th
2017-08-07 15:47:47
450
原创 Virtual Friends （并查集）
These days, you can do all sorts of things online. For example, you can use various websites to make virtual friends. For some people, growing their social network (their friends, their friends' friends, their
2017-08-07 15:44:13
767
原创 CodeForces 416C：Booking System（贪心）
Innovation technologies are on a victorious march around the planet. They integrate into all spheres of human activity!A restaurant called "Dijkstra's Place" has started thinking about optimizing the bookin
2017-08-06 15:44:34
395
原创 CodeForces 607B：Zuma（区间DP）
Genos recently installed the game Zuma on his phone. In Zuma there exists a line of n gemstones, the i-th of which has color ci. The goal of the game is to destroy all the gemstones in the line as quickly as po
2017-08-06 11:30:38
552
原创 2017百度之星资格赛 1003：度度熊与邪恶大魔王（DP）
度度熊为了拯救可爱的公主，于是与邪恶大魔王战斗起来。邪恶大魔王的麾下有n个怪兽，每个怪兽有a[i]的生命值，以及b[i]的防御力。度度熊一共拥有m种攻击方式，第i种攻击方式，需要消耗k[i]的晶石，造成p[i]点伤害。当然，如果度度熊使用第i个技能打在第j个怪兽上面的话，会使得第j个怪兽的生命值减少p[i]-b[j]，当然如果伤害小于防御，那么攻击就不会奏效。如果怪兽的生命值降为0或以下，那么怪兽就会被消灭。
2017-08-05 17:06:18
3265
8
原创 POJ 1651：Multiplication Puzzle（区间DP）
Multiplication PuzzleTime limit:1000 ms Memory limit:65536 kB Problem DescriptionThe multiplication puzzle is played with a row of cards, each containing a single positive integer. During the move pla
2017-08-04 20:58:55
417
原创 HDU 4283：You Are the One（区间DP）
The TV shows such as You Are the One has been very popular. In order to meet the need of boys who are still single, TJUT hold the show itself. The show is hold in the Small hall, so it attract a lot of boys an
2017-08-04 20:48:15
273
原创 POJ 2955：Brackets（区间DP）
We give the following inductive definition of a “regular brackets” sequence:the empty sequence is a regular brackets sequence,if s is a regular brackets sequence, then (s) and [s] are regular brackets sequen
2017-08-04 20:04:32
446
原创 CSU 1592：石子归并（区间DP）
现在有n堆石子，第i堆有ai个石子。现在要把这些石子合并成一堆，每次只能合并相邻两个，每次合并的代价是两堆石子的总石子数。求合并所有石子的最小代价。
2017-08-04 19:43:29
474
原创 CodeForces -337A：Puzzles（水）
The end of the school year is near and Ms. Manana, the teacher, will soon have to say goodbye to a yet another class. She decided to prepare a goodbye present for her n students and give each of them a jigsaw p
2017-08-04 08:41:28
839
原创 UVA 12034：Race （动态规划）
Disky and Sooma, two of the biggest mega minds of Bangladesh went to a far country. They ate, codedand wandered around, even in their holidays. They passed several months in this way. But everythinghas an e
2017-08-03 20:40:46
454
原创 CodeForces 455A：Boredom （动态规划）
Alex doesn't like boredom. That's why whenever he gets bored, he comes up with games. One long winter evening he came up with a game and decided to play it.
2017-08-03 16:48:23
913
原创 CodeForces 734D：Anton and Chess（模拟？）
Anton likes to play chess. Also, he likes to do programming. That is why he decided to write the program that plays chess. However, he finds the game on 8 to 8 board to too simple, he uses an infinite one inste
2017-08-02 17:46:34
352
原创 CSU 1815：Enterprising Escape（BFS+优先队列）
The Enterprise is surrounded by Klingons! Find the escape route that has the quickest exit time, and print that time. Input is a rectangular grid; each grid square either has the Enterprise or some class
2017-08-02 17:35:34
364
原创 HDU 1597：find the nth digit（水）
假设： S1 = 1 S2 = 12 S3 = 123 S4 = 1234 ……… S9 = 123456789 S10 = 1234567891 S11 = 12345678912 ………… S18 =
2017-08-02 17:27:19
508
1
原创 HDU 1548：A strange lift（BFS）
There is a strange lift.The lift can stop can at every floor as you want, and there is a number Ki(0 <= Ki <= N) on every floor.The lift have just two buttons: up and down.When you at floor i,if you press the b
2017-08-02 17:19:26
282
原创 CSU 1775：悲催的移寝（贪心）
对于csuxushu来说，能够在CSU（California State University）上学是他一生的荣幸，而换校区搬寝室则是他最大的不幸。顺利通过省赛选拔，开心的csuxushu现在需要着手准备搬家事宜。 对于好学的csuxushu来说，唯一头疼的就是书籍
2017-08-02 08:53:21
268
原创 POJ 1068：Parencodings（模拟）
Let S = s1 s2...s2n be a well-formed string of parentheses. S can be encoded in two different ways: q By an integer sequence P = p1 p2...pn where pi is the number of left parentheses before the ith right pare
2017-08-02 08:32:50
416
原创 CodeForces 825B：Five-In-a-Row（模拟）
Alice and Bob play 5-in-a-row game. They have a playing field of size 10 × 10. In turns they put either crosses or noughts, one at a time. Alice puts crosses and Bob puts noughts.
2017-08-01 21:01:36
577
原创 CodeForces 831A：Unimodal Array（模拟）
Unimodal Array Time limit:1000 ms Memory limit:262144 kB OS:Linux Problem DescriptionArray of integers is unimodal, if:it is strictly increasing in the beginning;after that it is constant;after tha
2017-08-01 20:48:39
511
原创 POJ 1328：Radar Installation（贪心）
Radar InstallationTime limit:1000 ms Memory limit:10000 kB OS:Linux Problem DescriptionAssume the coasting is an infinite straight line. Land is in one side of coasting, sea in the other. Each small i
2017-08-01 20:39:36
333
原创 CSU 1726：你经历过绝望吗？两次！ （BFS+优先队列）
4月16日，日本熊本地区强震后，受灾严重的阿苏市一养猪场倒塌，幸运的是，猪圈里很多头猪依然坚强存活。当地15名消防员耗时一天解救围困的“猪坚强”。不过与在废墟中靠吃木炭饮雨水存活36天的中国汶川“猪坚强”相比，熊本的猪可没那么幸运，因它们最终还是没能逃过被送往屠宰场的命运。
2017-08-01 08:32:13
733
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人