码代码的猿猿

2013年6月8日

摘要：复杂的递归。。。展开字符串Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 939 Accepted Submission(s): 398Problem Description在纺织CAD系统开发过程中，经常会遇到纱线排列的问题。该问题... 阅读全文

posted @ 2013-06-08 18:33 码代码的猿猿阅读(144) 评论(0) 推荐(0)

Codeforces Round #187 (Div. 2) A,B

摘要：又是只有AB。。。。C题看了1个小时都看不懂。。A. Sereja and Bottlestime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputSereja and his friends went to a picnic. The guys had... 阅读全文

posted @ 2013-06-08 17:36 码代码的猿猿阅读(256) 评论(0) 推荐(0)

2013年6月7日

HDOJ 1503 Advanced Fruits

摘要： Advanced FruitsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1194 Accepted Submission(s): 584Special JudgeProblem DescriptionThe company "2... 阅读全文

posted @ 2013-06-07 21:08 码代码的猿猿阅读(226) 评论(0) 推荐(0)

HDOJ 1224 Free DIY Tour

摘要：简单DPFree DIY TourTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2550 Accepted Submission(s): 838Problem DescriptionWeiwei is a software engi... 阅读全文

posted @ 2013-06-07 07:17 码代码的猿猿阅读(186) 评论(0) 推荐(0)

HDOJ 1267 下沙的沙子有几粒？

摘要：下沙的沙子有几粒？Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1964 Accepted Submission(s): 1019Problem Description2005年11月份，我们学校参加了ACM/ICPC 亚洲赛区成都... 阅读全文

posted @ 2013-06-07 00:53 码代码的猿猿阅读(179) 评论(0) 推荐(0)

2013年6月6日

HDOJ 1059 Dividing

摘要：惊现多重背包！马上水掉DividingTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 12116 Accepted Submission(s): 3394Problem DescriptionMarsha and Bill own a... 阅读全文

posted @ 2013-06-06 08:42 码代码的猿猿阅读(172) 评论(0) 推荐(0)

HDOJ 2059 龟兔赛跑

摘要：龟兔赛跑Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 8354 Accepted Submission(s): 3201Problem Description据说在很久很久以前，可怜的兔子经历了人生中最大的打击——赛跑输给乌龟后，心... 阅读全文

posted @ 2013-06-06 03:29 码代码的猿猿阅读(144) 评论(0) 推荐(0)

2013年6月5日

两种LIS-->n^2&&nlogn

摘要： n^2 的：初始化 dp 数组为 1dp[ i ] 表示以 i 结尾的 LIS 的长度for ( int i=0 ; i a [ j ]&&dp[ i ]LIS[cnt]) { cnt++; LIS[cnt]=c.r; } else { *lower_bound(LIS,LI... 阅读全文

posted @ 2013-06-05 01:56 码代码的猿猿阅读(156) 评论(0) 推荐(0)

HDOJ 1025 Constructing Roads In JGShining's Kingdom

摘要：坑爹题：先用n^2的LIS写，TLE了，然后改成nlogn的LIS又WA了。原来是 road 和 roads 不一样。。。。。。 The poor cities strongly BS each other 。。。。鄙视？？ Constructing Roads In JGShining's KingdomTime Limit: 2000/1000 MS (Java/Others) ... 阅读全文

posted @ 2013-06-05 01:44 码代码的猿猿阅读(347) 评论(0) 推荐(0)

HDOJ 1160 FatMouse's Speed

摘要：路径记录+LISFatMouse's Speed Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) ... 阅读全文

posted @ 2013-06-05 00:26 码代码的猿猿阅读(149) 评论(0) 推荐(0)

码代码的猿猿

公告