码迷,mamicode.com
首页 >  
搜索关键字:hdu 1069 monkey and    ( 31863个结果
hdu 2586 How far away ?
DescriptionThere are n houses in the village and some bidirectional roads connecting them. Every day peole always like to ask like this "How far is it...
分类:其他好文   时间:2014-05-25 22:47:22    阅读次数:283
HDU 4832(DP+计数问题)
HDU 4832 Chess 思路:把行列的情况分别dp求出来,然后枚举行用几行,竖用几行,然后相乘累加起来就是答案 代码: #include #include #include using namespace std; typedef long long ll; const ll MOD = 9999991; const int N = 1005; int t, n, m, ...
分类:其他好文   时间:2014-05-25 21:55:04    阅读次数:280
hdu 4831 Scenic Popularity(模拟)
题目链接:hdu 4831 Scenic Popularity 题目大意:略。 解题思路:对于休闲区g[i][0]和g[i][1]记录的是最近的两个景点的id(只有一个最近的话g[i][1]为0),对于景点来说,g[i][0]为-1(表示该id对应的是景点),g[i][1]为该景点的热度值.主要就是模拟,注意一些细节就可以了。 #include #include #include...
分类:其他好文   时间:2014-05-25 21:33:10    阅读次数:211
HDU 4831 Scenic Popularity
Scenic PopularityTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 117Accepted Submission(s): 25Prob...
分类:其他好文   时间:2014-05-25 20:17:16    阅读次数:348
HDU 4833 Best Financing (DP)
Best FinancingTime Limit: 20000/10000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 29Accepted Submission(s): 3Problem...
分类:其他好文   时间:2014-05-25 20:13:10    阅读次数:211
HDU 4832 Chess (DP)
ChessTime Limit: 6000/3000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 24Accepted Submission(s): 10Problem Descripti...
分类:其他好文   时间:2014-05-25 20:11:11    阅读次数:236
hdu 2841 Visible Trees(计数问题)
题目链接:hdu 2841 Visible Trees 题目大意:一个n?m的矩阵,每个整数点上有树,人站在(0,0)点,问可以看见多少棵树。 解题思路:和uva1393是一道相同类型的题目,只不过这道题目的n比较大,不能预处理。必须用另外一种方法。 将矩阵按照(0,0)和(n,m)两天连成的直线分成两部分,分别计算,但是(n,m)这条线被计算了两次,于是减掉1. dp[i]表示这...
分类:其他好文   时间:2014-05-25 18:21:47    阅读次数:227
hdu 1.3.3 今年暑假不AC
//简单.... 1 #include 2 #include 3 #include 4 using namespace std; 5 6 #define maxn 105 7 8 struct t 9 {10 int s;11 int e;12 };13 14 t T[maxn]...
分类:其他好文   时间:2014-05-25 16:04:07    阅读次数:215
HDU 2602 Bone Collector (01背包)
简单01背包 1 #include 2 #include 3 int max(int a,int b) 4 { 5 return a>b?a:b; 6 } 7 int main() 8 { 9 int t;10 int n,v;11 int f[1100],v...
分类:其他好文   时间:2014-05-25 13:55:14    阅读次数:196
HDU-1007-Quoit Design
Problem Description Have you ever played quoit in a playground? Quoit is a game in which flat rings are pitched at some toys, with all the toys encircled awarded. In the field of Cyberground, the ...
分类:其他好文   时间:2014-05-25 11:13:53    阅读次数:245
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!