hdoj - 随笔分类(第4页) - heaventouch

hdu 2838 Cow Sorting (树状数组)

摘要：Cow SortingTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2185Accepted Submission(s): 683Problem ... 阅读全文

posted @ 2014-04-26 10:02 heaventouch 阅读(277) 评论(0) 推荐(0)

hdu 1058 Humble Numbers (DP)

摘要：Humble NumbersTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 15978Accepted Submission(s): 6915Pro... 阅读全文

posted @ 2014-04-24 10:36 heaventouch 阅读(338) 评论(0) 推荐(0)

hdu 1069 Monkey and Banana (DP)

摘要：Monkey and BananaTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 6846Accepted Submission(s): 3508P... 阅读全文

posted @ 2014-04-24 09:44 heaventouch 阅读(191) 评论(0) 推荐(0)

hdu 1087 Super Jumping! Jumping! Jumping! (DP)

摘要：Super Jumping! Jumping! Jumping!Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 20485Accepted Subm... 阅读全文

posted @ 2014-04-23 23:55 heaventouch 阅读(145) 评论(0) 推荐(0)

hdu 1176 免费馅饼 (dp)

摘要：免费馅饼Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 23717Accepted Submission(s): 7989Problem Descr... 阅读全文

posted @ 2014-04-23 23:13 heaventouch 阅读(173) 评论(0) 推荐(0)

hdu 2084 数塔 (dp)

摘要：数塔Time Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 20191Accepted Submission(s): 12103Problem Descri... 阅读全文

posted @ 2014-04-23 21:40 heaventouch 阅读(204) 评论(0) 推荐(0)

hdu 1003 Max Sum (DP)

摘要：Max SumTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 134690Accepted Submission(s): 31181Problem ... 阅读全文

posted @ 2014-04-23 21:30 heaventouch 阅读(253) 评论(0) 推荐(0)

hdu DIY FLIGHT GAME (dfs)

摘要：FLIGHT GAMETime Limit : 3000/1000ms (Java/Other)Memory Limit : 65535/32768K (Java/Other)Total Submission(s) : 41Accepted Submission(s) : 10Font:Times ... 阅读全文

posted @ 2014-04-23 13:07 heaventouch 阅读(191) 评论(0) 推荐(0)

hdu 1823 Luck and Love (二维线段树)

摘要：Luck and LoveTime Limit: 10000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4897Accepted Submission(s): 1219Prob... 阅读全文

posted @ 2014-04-21 21:34 heaventouch 阅读(351) 评论(0) 推荐(0)

hdu 1556 Color the ball (树状数组)

摘要：Color the ballTime Limit: 9000/3000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 7540Accepted Submission(s): 3887Prob... 阅读全文

posted @ 2014-04-20 11:15 heaventouch 阅读(385) 评论(0) 推荐(0)

hdu 2874 Connections between cities (并查集+LCA)

摘要：Connections between citiesTime Limit: 10000/5000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4057Accepted Submission... 阅读全文

posted @ 2014-04-19 09:37 heaventouch 阅读(1250) 评论(0) 推荐(0)

hdu 3648 Median Filter (树状数组)

摘要：Median FilterTime Limit: 4000/2000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1092Accepted Submission(s): 269Proble... 阅读全文

posted @ 2014-04-17 14:39 heaventouch 阅读(377) 评论(0) 推荐(0)

poj 1330 Nearest Common Ancestors (LCA)

摘要：Nearest Common AncestorsTime Limit:1000MSMemory Limit:10000KTotal Submissions:16530Accepted:8839DescriptionA rooted tree is a well-known data structur... 阅读全文

posted @ 2014-04-15 16:07 heaventouch 阅读(185) 评论(0) 推荐(0)

hdu 2586 How far away ？ (LCA)

摘要：How far away ？Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4244Accepted Submission(s): 1617Prob... 阅读全文

posted @ 2014-04-13 11:12 heaventouch 阅读(247) 评论(0) 推荐(0)

hdu 2527 Safe Or Unsafe (哈夫曼树)

摘要：Safe Or UnsafeTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1388Accepted Submission(s): 544Problem DescriptionJavac++ 一天在看计算机的书籍的时候，看到了一个有趣的东西！每一串字符都可以被编码成一些数字来储存信息，但是不同的编码方式得到的储存空间是不一样的！并且当储存空间大于一定的值的时候是不安全的！所以Javac++ 就想是否有一种方式是可以得到字符编码最小的空间值！显然阅读全文

posted @ 2014-04-10 22:48 heaventouch 阅读(351) 评论(0) 推荐(0)

hdu 1053 Entropy (哈夫曼树)

摘要：EntropyTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3648Accepted Submission(s): 1451Problem DescriptionAn entropy encoder is a data encoding method that achieves lossless data compression by encoding a message with “wasted” or “extra” informatio 阅读全文

posted @ 2014-04-10 16:46 heaventouch 阅读(356) 评论(0) 推荐(0)

hdu 3231 Box Relations (拓扑排序)

摘要：Box RelationsTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 894Accepted Submission(s): 324Special JudgeProblem DescriptionThere arenboxesC1, C2, ..., Cnin 3D space. The edges of the boxes are parallel to thex, yorz-axis. We provide some relations 阅读全文

posted @ 2014-04-10 11:44 heaventouch 阅读(343) 评论(0) 推荐(0)

hdu 1575 Tr A (二分矩阵)

摘要：Tr ATime Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2449Accepted Submission(s): 1819Problem DescriptionA为一个方阵，则Tr A表示A的迹（就是主对角线上各项的和），现要求Tr(A^k)%9973。Input数据的第一行是一个T，表示有T组数据。每组数据的第一行有n(2 8 #include 9 #define N 997310 struct matrix{11 int g[15]... 阅读全文

posted @ 2014-04-09 21:21 heaventouch 阅读(229) 评论(0) 推荐(0)

hdu 1695 GCD (欧拉函数+容斥原理)

摘要：GCDTime Limit: 6000/3000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 5064Accepted Submission(s): 1818Problem DescriptionGiven 5 integers: a, b, c, d, k, you're to find x in a...b, y in c...d that GCD(x, y) = k. GCD(x, y) means the greatest common divisor of x an 阅读全文

posted @ 2014-04-09 19:57 heaventouch 阅读(293) 评论(0) 推荐(0)

hdu 2588 GCD (欧拉函数)

摘要：GCDTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 890Accepted Submission(s): 396Problem DescriptionThe greatest common divisor GCD(a,b) of two positive integers a and b,sometimes written (a,b),is the largest divisor common to a and b,For example,( 阅读全文

posted @ 2014-04-09 13:40 heaventouch 阅读(261) 评论(0) 推荐(0)

heaventouch

代码改变世界

随笔分类 - hdoj

公告