码迷,mamicode.com
首页 >  
搜索关键字:hdu 1495 非常可乐    ( 30957个结果
hdu 1176
数塔问题#include#includeusing namespace std;int a[100009][12];int maxi(int a,int b,int c){ int max1; max1=a>b?a:b; max1=max1>c?max1:c; return ...
分类:其他好文   时间:2014-05-07 19:25:00    阅读次数:302
hdu 3030 Increasing Speed Limits (离散化+树状数组+DP思想)
Increasing Speed LimitsTime Limit: 2000/10000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 481Accepted Submission(s):...
分类:其他好文   时间:2014-05-07 18:28:10    阅读次数:475
hdu 1102 Constructing Roads (最小生成树)
Constructing RoadsTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 12967Accepted Submission(s): 491...
分类:其他好文   时间:2014-05-07 18:04:54    阅读次数:266
hdu acm 1166 敌兵布阵 (线段树)
敌兵布阵Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 37903 Accepted Submission(s): 15985 Problem ...
分类:其他好文   时间:2014-05-07 17:52:06    阅读次数:317
hdu 1879 继续畅通工程 (最小生成树)
继续畅通工程Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 12717Accepted Submission(s): 5506Problem Des...
分类:其他好文   时间:2014-05-07 10:15:02    阅读次数:318
hdu 1233 还是畅通工程 (最小生成树)
还是畅通工程Time Limit: 4000/2000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 24027Accepted Submission(s): 10674Problem De...
分类:其他好文   时间:2014-05-07 10:07:17    阅读次数:352
水题~~~~HDU 4788
Description Yesterday your dear cousin Coach Pang gave you a new 100MB hard disk drive (HDD) as a gift because you will get married next year. But yo....
分类:其他好文   时间:2014-05-07 10:04:47    阅读次数:382
hdu 301 Jungle Roads (最小生成树)
Jungle RoadsTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 4073Accepted Submission(s): 2970Proble...
分类:其他好文   时间:2014-05-06 13:30:41    阅读次数:297
HDU 3001 Travelling 状态DP
TSP问题,不懂就是每个点最多访问两次,最少访问一次。所以,我们可以用三进制来当做状态。这个题练习了一下三进制……0、1、2 1 #include 2 #include 3 #include 4 #include 5 #include 6 #include 7 #include 8 #...
分类:其他好文   时间:2014-05-06 11:56:54    阅读次数:342
HDU 3501 Calculation 2 (欧拉函数)
题目链接题意 : 求小于n的数中与n不互质的所有数字之和。思路 : 欧拉函数求的是小于等于n的数中与n互质的数个数,这个题的话,先把所有的数字之和求出来,再减掉欧拉函数中所有质数之和(即为eular(n)*n/2),得到的就是最终结果,所以也是模板题一道。 1 //3501 2 #include ....
分类:其他好文   时间:2014-05-06 11:54:09    阅读次数:330
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!