2020年05月_随意凯

原创 AOJ 2200 Mr. Rito Post Office——floyd+动态dp

这道题做了一天，踩了不少坑。。呜呜呜题目大意快递到了：你是某个岛国（ACM-ICPC Japan）上的一个苦逼程序员，你有一个当邮递员的好基友利腾桑遇到麻烦了：全岛有一些镇子通过水路和旱路相连，走水路必须要用船，在X处下船了船就停在X处。而且岛上只有一条船，下次想走水路还是得回到X处才行；两个镇子之间可能有两条以上的水路或旱路；邮递员必须按照清单上的镇子顺序送快递（镇子可能重复，并且对于重复的镇子不允许一次性处理，比如ABCB的话B一定要按顺序走两次才行）。测试数据有多组：N Mx1 y1 t1

2020-05-28 18:32:49 433 1

原创 POJ 3268 Silver Cow Party——两次Dijkstra求解单源往返的最短路径问题

DescriptionOne cow from each of N farms (1 ≤ N ≤ 1000) conveniently numbered 1…N is going to attend the big cow party to be held at farm #X (1 ≤ X ≤ N). A total of M (1 ≤ M ≤ 100,000) unidirectional (one-way roads connects pairs of farms; road i requires

2020-05-28 09:39:30 234

原创 poj 3259 Wormholes——弗洛伊德判断是否存在负环

DescriptionWhile exploring his many farms, Farmer John has discovered a number of amazing wormholes. A wormhole is very peculiar because it is a one-way path that delivers you to its destination at a time that is BEFORE you entered the wormhole! Each of F

2020-05-27 22:16:37 1020

原创 poj 1703 Find them, Catch them——种类并查集的最简单例题

DescriptionThe police office in Tadu City decides to say ends to the chaos, as launch actions to root up the TWO gangs in the city, Gang Dragon and Gang Snake. However, the police first needs to identify which gang a criminal belongs to. The present quest

2020-05-27 11:29:57 231

转载并查集之种类并查集——详解

知乎上看到的一篇文章，解释得非常到位了，有图有文字有题目种类并查集详解

2020-05-27 10:53:10 933

原创 poj 2010 Moo University - Financial Aid——优先队列+贪心（详细注释）

DescriptionBessie noted that although humans have many universities they can attend, cows have none. To remedy this problem, she and her fellow cows formed a new university called The University of Wisconsin-Farmside,“Moo U” for short.Not wishing to admi

2020-05-26 18:47:16 210

原创 POJ 3614 Sunscreen——贪心与优先队列的完美结合

DescriptionTo avoid unsightly burns while tanning, each of the C (1 ≤ C ≤ 2500) cows must cover her hide with sunscreen when they’re at the beach. Cow i has a minimum and maximum SPF rating (1 ≤ minSPFi ≤ 1,000; minSPFi ≤ maxSPFi ≤ 1,000) that will work.

2020-05-25 11:22:16 222

随意凯的博客

原创 AOJ 2200 Mr. Rito Post Office——floyd+动态dp

原创 POJ 3268 Silver Cow Party——两次Dijkstra求解单源往返的最短路径问题

原创 poj 3259 Wormholes——弗洛伊德判断是否存在负环

原创 poj 1703 Find them, Catch them——种类并查集的最简单例题

转载并查集之种类并查集——详解

原创 poj 2010 Moo University - Financial Aid——优先队列+贪心（详细注释）

原创 POJ 3614 Sunscreen——贪心与优先队列的完美结合

原创 POJ 2148 Cow Exhibition——01背包方法遇到负状态的处理方法

原创 POJ 3666 Making the Grade——有难度的动态规划

原创 POJ 1631——LIS最长上升子序列的三种解法

原创 POJ 3181 Dollar Dayz——两种方法实现划分数问题

原创 POJ 3046 Ant Counting——多重集组合数+滚动数组

原创 POJ Coins——多重部分和问题（两种解法）

原创 POJ 3280 Cheapest Palindrome——动态规划

原创 POJ 2385 Apple Catching——记忆搜索或者动态规划

原创 POJ 2229 Sumsets——动态规划

原创 POJ 3040 Allowance——经典贪心算法题目

原创 POJ1017 Packets——理解贪心的经典题目

原创 POJ Stall Reservations——贪心区间+优先队列

空空如也

空空如也