2015 年 5月随笔档案 - 爱装逼的书呆子

zoj 3471(状态压缩DP,类似于点集配对)

摘要：Most PowerfulTime Limit:2 Seconds Memory Limit:65536 KBRecently, researchers on Mars have discovered N powerful atoms. All of them are different. Thes... 阅读全文

posted @ 2015-05-27 21:29 爱装逼的书呆子阅读(170) 评论(0) 推荐(0)

hdu 1719

摘要：FriendTime Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 2073Accepted Submission(s): 1046 Problem De... 阅读全文

posted @ 2015-05-26 16:21 爱装逼的书呆子阅读(144) 评论(0) 推荐(0)

uva 11235

摘要：2007/2008 ACM International Collegiate Programming Contest University of Ulm Local ContestProblem F: Frequent valuesYou are given a sequence of n inte... 阅读全文

posted @ 2015-05-26 16:16 爱装逼的书呆子阅读(176) 评论(0) 推荐(0)

hdu 4722 (数位DP)

摘要：Good NumbersTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 3360Accepted Submission(s): 1064 Prob... 阅读全文

posted @ 2015-05-26 16:09 爱装逼的书呆子阅读(313) 评论(0) 推荐(0)

hdu 1284

摘要：钱币兑换问题Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 7261Accepted Submission(s): 4265 Problem De... 阅读全文

posted @ 2015-05-26 15:57 爱装逼的书呆子阅读(153) 评论(0) 推荐(0)

hdu1059(多重背包)

摘要：DividingTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 19495Accepted Submission(s): 5481 Problem... 阅读全文

posted @ 2015-05-26 15:50 爱装逼的书呆子阅读(303) 评论(0) 推荐(0)

hdu 3333(树状数组 + 离线操作)

摘要：Turing TreeTime Limit: 6000/3000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3847Accepted Submission(s): 1306Problem... 阅读全文

posted @ 2015-05-22 16:47 爱装逼的书呆子阅读(277) 评论(0) 推荐(0)

hdu 3669(斜率优化DP)

摘要：Cross the WallTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 327680/327680 K (Java/Others)Total Submission(s): 4479Accepted Submission(s): 812Pro... 阅读全文

posted @ 2015-05-21 15:57 爱装逼的书呆子阅读(254) 评论(0) 推荐(0)

NPU 2015年陕西省程序设计竞赛网络预赛（正式赛）F题和谐的比赛（递推 ||卡特兰数（转化成01字符串））

摘要：Description今天西工大举办了一场比赛总共有m+n人，但是有m人比较懒没带电脑,另外的n个人带了电脑。不幸的是，今天机房的电脑全坏了只能用带的电脑，一台电脑最多两人公用，确保n>=m。但是大家来的时间不同，随机次序来机房，带电脑的人直接准备比赛而没带电脑的人需要向带电脑并还没和别人公用的人求... 阅读全文

posted @ 2015-05-20 22:09 爱装逼的书呆子阅读(189) 评论(0) 推荐(0)

hdu 2553（N皇后问题）

摘要：N皇后问题Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 11505Accepted Submission(s): 5112Problem Desc... 阅读全文

posted @ 2015-05-20 18:17 爱装逼的书呆子阅读(177) 评论(0) 推荐(0)

uva 11401

摘要：Triangle CountingInput:Standard InputOutput:Standard OutputYou are givennrods of length 1, 2…, n. You have to pick any 3 of them & build a triangle. H... 阅读全文

posted @ 2015-05-20 15:42 爱装逼的书呆子阅读(166) 评论(0) 推荐(0)

hdu 3507(DP+斜率优化)

摘要：Print ArticleTime Limit: 9000/3000 MS (Java/Others)Memory Limit: 131072/65536 K (Java/Others)Total Submission(s): 6653Accepted Submission(s): 2054Prob... 阅读全文

posted @ 2015-05-17 22:16 爱装逼的书呆子阅读(191) 评论(0) 推荐(0)

zoj 3861(dfs)

摘要：Valid Pattern LockTime Limit: 2 Seconds Memory Limit: 65536 KBPattern lock security is generally used in Android handsets instead of a password. Th... 阅读全文

posted @ 2015-05-13 21:41 爱装逼的书呆子阅读(244) 评论(0) 推荐(0)

zoj 3865

摘要：SuperbotTime Limit:2 Seconds Memory Limit:65536 KBSuperbotis an interesting game which you need to control the robot on anN*Mgrid map.As you see, it's... 阅读全文

posted @ 2015-05-12 23:36 爱装逼的书呆子阅读(158) 评论(0) 推荐(0)

最短路

摘要：参考：http://blog.csdn.net/shuangde800/article/details/7987100Foyed算法(动态规划):i,j之间的最短路要么直接相连，要么通过一系列其他的点。设为从到的只以集合中的节点为中间节点的最短路径的长度。 //状态的定义十分重要,要想清楚,不然搞死... 阅读全文

posted @ 2015-05-12 20:36 爱装逼的书呆子阅读(341) 评论(0) 推荐(0)

zoj 3866

摘要：G -Cylinder CandyTime Limit:2000MSMemory Limit:65536KB64bit IO Format:%lld & %lluSubmitStatusPracticeZOJ 3866DescriptionEdward the confectioner is mak... 阅读全文

posted @ 2015-05-10 19:21 爱装逼的书呆子阅读(190) 评论(0) 推荐(0)

线段树模板 (刘汝佳)

摘要：一、线段树（点修改）Update(x,v): 把Ax修改为vQuery(L,R): 计算区间[qL,qR] 最小值。代码：[cpp]view plaincopy//DynamicRMQ//RujiaLiu//输入格式：//nm数组范围是a[1]~a[n]，初始化为0。操作有m个//1pv表示设a[p... 阅读全文

posted @ 2015-05-09 11:58 爱装逼的书呆子阅读(471) 评论(0) 推荐(0)

poj 3468

摘要：A Simple Problem with IntegersTime Limit:5000MSMemory Limit:131072KTotal Submissions:71540Accepted:22049Case Time Limit:2000MSDescriptionYou haveNinte... 阅读全文

posted @ 2015-05-09 11:55 爱装逼的书呆子阅读(173) 评论(0) 推荐(0)

hdu 2829（四边形优化 && 枚举最后一个放炸弹的地方）

摘要：LawrenceTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2484Accepted Submission(s): 1105Problem De... 阅读全文

posted @ 2015-05-09 11:47 爱装逼的书呆子阅读(267) 评论(0) 推荐(0)

poj 3517(约瑟夫环问题)

摘要：And Then There Was OneTime Limit: 5000MSMemory Limit: 65536KTotal Submissions: 4873Accepted: 2598DescriptionLet’s play a stone removing game.Initially... 阅读全文

posted @ 2015-05-07 17:04 爱装逼的书呆子阅读(192) 评论(0) 推荐(0)

poj 1160

摘要：Post OfficeTime Limit: 1000MSMemory Limit: 10000KTotal Submissions: 16730Accepted: 9053DescriptionThere is a straight highway with villages alongside ... 阅读全文

posted @ 2015-05-06 21:20 爱装逼的书呆子阅读(190) 评论(0) 推荐(0)

hdu 2476 (string painter) ( 字符串刷子区间DP)

摘要：String painterTime Limit: 5000/2000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2068Accepted Submission(s): 908Probl... 阅读全文

posted @ 2015-05-06 19:14 爱装逼的书呆子阅读(246) 评论(0) 推荐(0)

zoj 3872

摘要：D -Beauty of ArrayTime Limit:2000MSMemory Limit:65536KB64bit IO Format:%lld & %lluSubmitStatusPracticeZOJ 3872Appoint description:DescriptionEdward ha... 阅读全文

posted @ 2015-05-03 11:04 爱装逼的书呆子阅读(508) 评论(0) 推荐(0)

zoj 3870

摘要：B - Team Formation Time Limit:3000MS Memory Limit:131072KB 64bit IO Format:%lld & %lluSubmit Status Practice ZOJ 3870DescriptionFor an upcoming progra... 阅读全文

posted @ 2015-05-02 22:24 爱装逼的书呆子阅读(189) 评论(0) 推荐(0)

hdu 2227

摘要：Find the nondecreasing subsequencesTime Limit: 10000/5000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1564Accepted S... 阅读全文

posted @ 2015-05-02 11:50 爱装逼的书呆子阅读(238) 评论(0) 推荐(0)

05 2015 档案