一点一滴，从不止步！

Problem D Time Limit : 2000/1000ms (Java/Other)   Memory Limit : 65536/32768K (Java/Other) Total Submission(s) : 33   Accepted Submission(s) : 17 Problem Description 某国为了防御敌国的导弹袭击,发展出一种导弹拦

一看就是贪心，想了个策略，

https://icpcarchive.ecs.baylor.edu/external/64/6481.pdf

分析：贪心吧，让每次跳的点尽量小。 石头是可能无序的，比赛是实在没发现，就加了个排序过了，哎。。。 代码： #include #include #include #include #include #include #include #include #define MOD 1000000007 typedef long long ll; using namespace std; cons

http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=4482

http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=2034

http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=27&page=show_problem&problem=2619

http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=4197

Battle for Silver Time Limit: 2999/999MS (Java/Others)     Memory Limit: 65432/65432KB (Java/Others) Submit  Status Piet Hein was a Dutch naval officer during the Eighty Years' War b

http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=4481

J - Problem J Time Limit:1000MS     Memory Limit:65536KB     64bit IO Format:%I64d & %I64u Submit Status Description Oh those picky N (1 <= N <= 50,000) cows! They are so picky that

分析：这题很像Codefoces 432 C. Prime Swaps（水），我就直接处理数据