- 博客(15)
- 收藏
- 关注
原创 2013 Multi-University Training Contest 1
/*E:DequeAC 328MS 2680K 1265B C++题意:按顺序给你一列数,一个一个的,你可以依次将它插到一个deque里,方法是可以place到头或尾,也可以先pop掉头或尾的元素,再进行place操作,最后使deque(不下降)的长度最长分析:对每一个数进行枚举,分别记录按顺序place后,包含该数的最长不下降和最长不上升子序列的长度len1,len2,另外也需要
2013-07-29 10:51:51 962 2
原创 Poj 2533-Longest Ordered Subsequence(最长有序子序列)
题意:就是求最长上升子序列。分析:有朴素的O(N^2)的简单dp,也有O(nlogn)的二分思想。方法一:dp,对应原序列的每个元素,dp数组记录包含这个数在内的与之前所有数一起能构成的最长有序子序列的长度,最后对dp数组遍历取最大值即可 #include#include#include#includeusing namespace std;int a[1005
2013-07-27 01:47:13 1033
原创 UVA 11997 K Smallest Sums --最小堆
K Smallest SumsTime Limit:1000MS Memory Limit:0KB 64bit IO Format:%lld & %llu UVA 11997DescriptionProblem KK Smallest SumsYou're given k arrays, each array
2013-07-24 11:46:27 777
原创 Poj 1182 食物链--带边权的并查集
食物链Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 35967 Accepted: 10441Description动物王国中有三类动物A,B,C,这三类动物的食物链构成了有趣的环形。A吃B, B吃C,C吃A。 现有N个动物,以1-N编号。每个动物都是A
2013-07-24 09:44:55 1223
原创 Poj 2560 || Hdu 1162 Freckles--最小生成树
FrecklesTime Limit: 1000MS Memory Limit: 65536K DescriptionIn an episode of the Dick Van Dyke show, little Richie connects the freckles on his Dad's back to form
2013-07-23 21:34:52 881
转载 程序员技术练级攻略(转)
转载自:http://coolshell.cn/articles/4990.html 月光博客6月12日发表了《写给新手程序员的一封信》,翻译自《An open letter to those who want to start programming》,我的朋友(他在本站的id是Mailper)告诉我,他希望在酷壳上看到一篇更具操作性的文章。因为他也是喜欢编程和技术的家伙,于是,我让他把
2013-07-16 20:43:20 879
原创 Uva 1160 X-Plosives ——并查集
X-PlosivesTime Limit:3000MS Memory Limit:0KB 64bit IO Format:%lld & %lluSubmit Status Practice UVA 1160DescriptionX-Plosives A secret service developed a new kind of ex
2013-07-16 10:57:43 907
原创 优先队列模拟最大堆和最小堆,poj 1442 Black Box
Black BoxTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 5619 Accepted: 2265DescriptionOur Black Box represents a primitive database. It can save an integ
2013-07-16 10:49:25 883
原创 二叉树 Poj 1577 Falling Leaves
Falling LeavesTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 3588 Accepted: 2005Description Figure 1Figure 1 shows a graphical representation of
2013-07-16 10:22:49 935
转载 Ac Rush 楼天成回忆录
/* 编题过程变得有些枯燥,于是打开网页看会博客,发现了这篇早就应该拜读的文章,凭着对楼教主的崇敬,开始读他的回忆录。他的每次比赛在外人看来都是惊心动魄,像一场盛事被众人围观,可是越读他的回忆,越发觉得就像日记一样的平淡,这种平淡里又充满了激情,迷人而又充满危机。一字一句的品读,一步一步为他的成功心生欢喜,为他的失误感到遗憾。楼教主仿佛太过谦逊了,在那激动人心的5个小时里,怀
2013-07-11 14:06:32 2178
原创 背包(5)Hdu 1561 The more, The Better(有限制的背包,分组背包)
The more, The BetterTime Limit:2000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmit StatusDescriptionACboy很喜欢玩一种战略游戏,在一个地图上,有N座城堡,每座城堡都有一定的宝物,在每次游戏中ACboy允许攻克M个城堡
2013-07-02 21:26:51 804
原创 背包(4)Hdu 1520 Anniversary party(树形背包)+ Poj 1463 Strategic game(还可以贪心来做)
Anniversary partyTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2779 Accepted Submission(s): 1239Problem DescriptionThere is goi
2013-07-02 19:14:54 1073
原创 背包(3)Hdu1712 ACboy needs your help(分组背包)
ACboy needs your helpTime Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2710 Accepted Submission(s): 1390Problem DescriptionACboy ha
2013-07-02 17:46:53 870
原创 背包(2)poj1276 Cash Machine(多重背包)
Cash MachineTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 22943 Accepted: 8038DescriptionA Bank plans to install a machine for cash withdrawal. The mach
2013-07-02 17:40:33 640
原创 背包(1)poj 1384||hdu 1114 Piggy-bank --- 完全背包
Piggy-BankTime Limit: 1000MS Memory Limit: 10000K DescriptionBefore ACM can do anything, a budget must be prepared and the necessary financial support obtained. Th
2013-07-02 17:37:00 795
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人