C. Zero-One 题目连接: http://codeforces.com/contest/135/problem/C Description Little Petya very much likes playing…
分类:Online Judge
Codeforces Beta Round #2 A. Winner 水题
A. Winner 题目连接: http://www.codeforces.com/contest/2/problem/A Description The winner of the card game popular …
HDU 5745 La Vie en rose 暴力
La Vie en rose 题目连接: http://acm.hdu.edu.cn/showproblem.php?pid=5745 Description Professor Zhang would like to …
HDU 1077 Catching Fish(计算几何,用单位圆围尽量多的点)
Catching Fish Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/32768 …
ACM/ICPC 之 DP-基因相似度(POJ1080-ZOJ1027)
题意:两端基因片段,各有明确的碱基序列,现有一个碱基匹配的相似度数组,设计程序使得该相似度最大。 1 //POJ1080-ZOJ1027 2 //题解:将s1碱基和s2碱基看做等…
ACM/ICPC 之 拓扑排序范例(POJ1094-POJ2585)
两道拓扑排序问题的范例,用拓扑排序解决的实质是一个单向关系问题 POJ1094(ZOJ1060)-Sortng It All Out 题意简单,但需要考虑的地方很多,…
BZOJ 2761: [JLOI2011]不重复数字 水题
2761: [JLOI2011]不重复数字 Time Limit: 10 Sec Memory Limit: 162 MBSubmit: 2100 Solved: 809 题目…
hdu 5265 pog loves szh II STL
pog loves szh II Time Limit: 20 Sec Memory Limit: 256 MB 题目连接 http://acm.hdu.edu.cn/showproblem.php?pid=5265 D…
HDU 2568[前进]模拟
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=2568 题目大意:可以杀死一半蝙蝠(要求蝙蝠为偶数)或杀死一只蝙蝠。问n只蝙蝠要做几次上述操作才能杀完 关键思想:傻傻地模拟…
Codeforces Round #354 (Div. 2) D. Theseus and labyrinth bfs
D. Theseus and labyrinth 题目连接: http://www.codeforces.com/contest/676/problem/D Description Theseus has just ar…
POJ 2411 Mondriaan's Dream(压缩DP)
Mondriaan’s Dream Time Limit: 3000MS Memory Limit: 65536K Total Submissions: 8974 …
POJ 1192 最优连通子集(树形DP)
最优连通子集 Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 1649 Accepted: 855 Description…