### HDU 5821 – Ball [思路/贪心]

Link http://acm.hdu.edu.cn/showproblem.php?pid=5821 Mean 给定两个长度为N的数列A和B，有M次操作，每次可以把Li到Ri段的数字打乱重排，问你能否通过M次操作把A变成B Analysis 多校场上想了好久没想出来，思路越来越不行了，可能是最近花在ACM上的时间越来越少了吧...

### POJ 3617 – Best Cow Line [贪心+枚举]

Link 传送门 Problem FJ is about to take his N (1 ≤ N ≤ 2,000) cows to the annual”Farmer of the Year” competition. In this contest every farmer arranges his cows in a line and herds them past the judges. The contest organizers adopted a...

#### POJ 3617 – Best Cow Line [贪心+枚举]

Link 传送门 Problem FJ is about to take his N (1 ≤ N ≤ 2,000) cows to the annual”Farmer of the Year” competition. In this contest every...

### UVa 10535 – Shooter [贪心+几何]

Link 传送门 Problem The shooter is in a great problem. He is trapped in a “2D” maze with a laser gun and can use it once. The gun is very powerful and the laser ray, it emanates can traverse infinite distance in its direction. In the maze the targ...

#### UVa 10535 – Shooter [贪心+几何]

Link 传送门 Problem The shooter is in a great problem. He is trapped in a “2D” maze with a laser gun and can use it once. The gun is very powerful ...

### UVa 1344 – Tian Ji — The Horse Racing [贪心+分类讨论]

Link 点击打开题目链接 Problem Were Tian Ji lives in nowadays, he will certainly laugh at himself. Even more, were he sitting in the ACM contest right now, he may discover that the horse racing problem can be simply viewed as finding the maximum ma...

#### UVa 1344 – Tian Ji — The Horse Racing [贪心+分类讨论]

Link 点击打开题目链接 Problem Were Tian Ji lives in nowadays, he will certainly laugh at himself. Even more, were he sitting in the ACM contest rig...

### UVa 11134 – Fabled Rooks [贪心]

Link 点击打开题目链接 Problem We would like to place n rooks, 1 ≤ n ≤ 5000, on a n × n board subject to the following restrictions • The i-th rook can only be placed within the rectangle given by its left-upper corner (xli , yli) and its rightlowe...

#### UVa 11134 – Fabled Rooks [贪心]

Link 点击打开题目链接 Problem We would like to place n rooks, 1 ≤ n ≤ 5000, on a n × n board subject to the following restrictions • The i-th rook ...

### UVa 10905 – Children’s Game [贪心+排序+思路]

Link 点击打开uva题目链接 Mean 给定n个正整数，你的任务是把他们链接成一个最大的整数。比如，123、124、56、90有24种链接方法，最大的结果是9056124123. Analyse 这个题以前在知乎上看到过，记得是一个人推荐的思维性比较高的面试题。思路实际上就是一个排序，排序...