- 博客(9)
- 收藏
- 关注
原创 uva 10537 - The Toll! Revisited (逆向思维+最短路+输出字典序最小路径)
Problem GToll! RevisitedInput: Standard InputOutput: Standard OutputTime Limit: 1 Second Sindbad the Sailor sold 66 silver spoons to the Sultan of Samarkand. The selling was quite easy; bu
2014-06-29 20:09:01 1239
原创 hdu 4123 Bob’s Race (树的直径相关+rmq+单调队列思想)
Bob’s RaceTime Limit: 5000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2115 Accepted Submission(s): 658Problem DescriptionBob wants to hol
2014-06-28 21:46:58 1024
原创 poj 2749 Building roads (二分+拆点+2-sat)
Building roadsTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 6229 Accepted: 2093DescriptionFarmer John's farm has N barns, and there are some cows that
2014-06-28 00:48:31 1640
原创 UVA11090 Going in Cycle!! (二分+SPFA判断有无负权)
I I U P C 2 0 0 6Problem G: Going in Cycle!!Input: standard inputOutput: standard output You are given a weighted directed graph with n vertices and
2014-06-27 00:02:42 1309
原创 poj 1085 Triangle War (状压+记忆化搜索)
Triangle WarTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 2685 Accepted: 1061DescriptionTriangle War is a two-player game played on the following tria
2014-06-26 23:57:59 1495
原创 uva 10795 - A Different Task (递归+状态转移)
题目链接:uva 10795 - A Different Task题意:新汉若塔问题,有n个盘子,放在3个盘子上,给你一个初始状态和一个结束状态,问你最小步数怎样到达。思路:递归+状态转移,直接从初态到末态好像不是那么好办,对最大的一块n,首先肯定要把他放在末态的位置上,假设开始在1号位置,要放到3号位置,那么必须先到达这个状态s:1~n-1必须都从大到小放在2上面
2014-06-17 23:45:59 1078
原创 poj 3249 Test for Job (DAG最长路 记忆化搜索解决)
Test for JobTime Limit: 5000MS Memory Limit: 65536KTotal Submissions: 8990 Accepted: 2004DescriptionMr.Dog was fired by his company. In order to support his famil
2014-06-16 22:06:17 1204
原创 uva 11825 Hackers' Crackdown (状压dp,子集枚举)
题目链接:uva 11825题意:你是一个黑客,侵入了n台计算机(每台计算机有相同的n种服务),对每台计算机,你可以选择终止一项服务,则他与其相邻的这项服务都终止。你的目标是让更多的服务瘫痪(没有计算机有该项服务)。思路:(见大白70页,我的方程与大白不同)把n个集合P1、P2、Pn分成尽量多的组,使得每组中所有集合的并集等于全集,这里的集合Pi是计算机i及其相邻计
2014-06-15 16:23:56 1023
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人