- 博客(46)
- 收藏
- 关注
原创 POJ 1011 Sticks(经典dfs)
Language:Default简体中文SticksTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 120720 Accepted: 27951DescriptionGeorge took sticks of the same length a
2014-08-26 10:14:25 737
原创 POJ 3368 Frequent values(线段树区间合并)
Frequent valuesTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 13352 Accepted: 4913DescriptionYou are given a sequence of n integers a1 , a2 , ... , an
2014-08-24 20:25:59 850
原创 HDU 1394 Minimum Inversion Number (线段树)
HDU 1394 Minimum Inversion Number (线段树)
2014-08-22 14:12:52 804
原创 POJ3083 Children of the Candy Corn dfs+bfs
POJ3083 Children of the Candy Corn dfs+bfs,好难的dfs
2014-08-20 21:45:33 741
原创 POJ 2472 106 miles to Chicago
POJ 2472 106 miles to Chicago floyd || dijkstra
2014-08-19 20:45:32 818
转载 HDU1226:超级密码(BFS)
Problem DescriptionIgnatius花了一个星期的时间终于找到了传说中的宝藏,宝藏被放在一个房间里,房间的门用密码锁起来了,在门旁边的墙上有一些关于密码的提示信息:密码是一个C进制的数,并且只能由给定的M个数字构成,同时密码是一个给定十进制整数N(0注意:由于宝藏的历史久远,当时的系统最多只能保存500位密码.因此如果得到的密码长度大于500也不能用来开启房门
2014-08-15 15:03:12 621
原创 poj 2031 Building a Space Station(最小生成树)
poj 2031 Building a Space Station(最小生成树)
2014-08-12 23:17:07 1286
转载 搜索题目集合
得做啊,哈哈~~1010 stamps1011 sticks Accepted 2006-08-03 04:091020 Anniversary Cake1022 Packing Unit 4D Cubes1024 Tester Program1054 The Troublesome Frog1062 昂贵的聘礼暂告一段落,先把DP题做一下,因为两者有很多交叉的
2014-08-06 21:33:29 826
转载 hdu 1540 神奇的线段树
Problem DescriptionDuring the War of Resistance Against Japan, tunnel warfare was carried out extensively in the vast areas of north China Plain. Generally speaking, villages connected by tunnels
2014-08-06 16:54:26 675
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人