dp
文章平均质量分 85
utoppia
这个作者很懒,什么都没留下…
展开
-
hud 1114 Piggy-Bank
题目描述: Piggy-BankTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 5814 Accepted Sub原创 2012-10-17 00:29:22 · 475 阅读 · 0 评论 -
hdu 3075 Print Article
题目描述:Print ArticleTime Limit: 9000/3000 MS (Java/Others) Memory Limit: 131072/65536 K (Java/Others)Total Submission(s): 2485 Accepted Submission(s): 815Problem DescriptionZero原创 2012-10-22 00:05:15 · 654 阅读 · 0 评论 -
hdu 2177 取(2堆)石子游戏
题目描述:取(2堆)石子游戏Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 449 Accepted Submission(s): 273Problem Description有两堆石子,数量任意,可以不同。游戏开始由原创 2012-10-22 19:23:32 · 379 阅读 · 0 评论 -
sgu 131 Hardwood floor
题目描述:131. Hardwood floortime limit per test: 0.5 sec. memory limit per test: 4096 KBThe banquet hall of Computer Scientists' Palace has a rectangular form of the size M x N (11) rect原创 2012-11-01 18:48:23 · 908 阅读 · 1 评论 -
sgu 149 Computer Network
题目描述:149. Computer Networktime limit per test: 0.5 sec.memory limit per test: 4096 KBinput: standard inputoutput: standard outputA school bought the first computer some time原创 2012-11-04 15:34:50 · 468 阅读 · 0 评论 -
sgu 143 Long Live the Queen
题目描述:143. Long Live the Queen time limit per test: 0.5 sec. memory limit per test: 4096 KBThe Queen of Bytelandis very loved by her people. In order to show her their love, the Bytelan原创 2012-11-04 10:47:31 · 570 阅读 · 0 评论 -
sgu 168 Matrix
168. Matrixtime limit per test: 1 sec.memory limit per test: 16000 KBinput: standardoutput: standardYou are given N*M matrix A. You are to find such matrix B, that B[i,j]=min{ A[x,原创 2012-11-06 00:19:01 · 442 阅读 · 0 评论 -
sgu 199 Beautiful People
199. Beautiful Peopletime limit per test: 0.5 sec.memory limit per test: 65536 KBinput: standardoutput: standardThe most prestigious sports club in one city has exactly N members.原创 2012-11-08 12:31:05 · 828 阅读 · 0 评论 -
POJ 3537 Crosses and Crosses
POJ 3537 Crosses and Crosses我们取一个位置之后,对手在这个点的左边和右边的两点之内都不能选。相当于一次取了五个位置。所以 sg[i] = mex{ sg[j-3]^sg[i-j-2] | 1#include#include#include#include#include#include#include#include#include原创 2013-08-19 11:36:35 · 749 阅读 · 0 评论 -
Uva 10617 Again Palindromes
CLICK ME问一个字符串的子序列是回文串的个数;dp#include#include#includeusing namespace std;char s[70];long long dp[70][70];int main() { int cas; //freopen("input.txt","r",stdin); scanf("%d",&cas原创 2013-08-23 21:12:09 · 615 阅读 · 0 评论 -
POJ2068 Nim
POJ2068 Nim简单的博弈dp,记忆话搜索可能好些一点。#include#include#include#include#include#include#include#include#includeusing namespace std;#define FOR(i,a,b) for(int (i)=(a);(i)<=(b);(i)++)#define DO原创 2013-08-17 11:43:27 · 658 阅读 · 0 评论 -
HDU 1011 Starship Troopers
树形dp#include #include #include #include #include using namespace std;#define sf scanf#define pf printf#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)#define dbg(x) cerr << "Line:" << __L原创 2013-11-10 13:53:54 · 760 阅读 · 0 评论 -
Ural 1437
I HATE THIS PROBLEM!!! I just write a BF solution like this:#include#include#include#include#include#include#includeusing namespace std;#define sf scanf#define pf printf#define re原创 2013-11-27 13:42:15 · 639 阅读 · 0 评论 -
Ural 1362 Classmates 2
Link To The Pro其实就是简单的树形dp;假设v1,v2,v3..vs是u的儿子,那么将dp[vi]从大到小排序;dp[u] = max(dp[v_i] + i];Code:#include#include#include#include#include#includeusing namespace std;#define原创 2013-11-27 09:58:00 · 955 阅读 · 0 评论 -
hdu 3415 Max Sum of Max-K-sub-sequence
题目描述:Max Sum of Max-K-sub-sequenceTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4208 Accepted Submission(s): 1503Problem De原创 2012-10-22 11:48:28 · 966 阅读 · 0 评论 -
hdu 2955 Robberies
题目描述:RobberiesTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 5324 Accepted Submission(s): 2009Problem DescriptionThe aspir原创 2012-10-19 19:46:18 · 457 阅读 · 0 评论 -
hdu 1074 Doing Homework
题目描述:Doing HomeworkTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3279 Accepted Submission(s): 1272Problem D原创 2012-10-16 23:22:45 · 457 阅读 · 0 评论 -
hdu 1159 Common Subsequence 最长公共子序列
题目描述: Common SubsequenceTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 13970 Accepted Submission(s原创 2012-10-17 00:42:52 · 518 阅读 · 0 评论 -
hdu 1160 FatMouse's Speed
题目描述: FatMouse's SpeedTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 5675 Accepted Submission(原创 2012-10-17 01:06:04 · 634 阅读 · 0 评论 -
hdu 1171 Big Event in HDU
题目描述:Big Event in HDUTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 14161 Accepted Submission(s): 4979Problem Description原创 2012-10-17 18:50:33 · 387 阅读 · 0 评论 -
hdu 1176 免费馅饼
题目描述:免费馅饼Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 15025 Accepted Submission(s): 4979Problem Description都说天上不会掉馅饼,但有一原创 2012-10-17 19:25:23 · 348 阅读 · 0 评论 -
hdu 1203 I NEED A OFFER!
题目描述:I NEED A OFFER!Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 10310 Accepted Submission(s): 3858Problem DescriptionSp原创 2012-10-17 20:24:16 · 318 阅读 · 0 评论 -
hdu 1421 搬寝室
题目描述:搬寝室Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 10056 Accepted Submission(s): 3370Problem Description搬寝室是很累的,xhd深有体原创 2012-10-18 00:23:14 · 392 阅读 · 0 评论 -
hdu 1260 Tickets
题目描述:TicketsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 560 Accepted Submission(s): 280Problem DescriptionJesus, what a原创 2012-10-17 22:51:41 · 748 阅读 · 0 评论 -
hdu 1978 How many ways
题目描述:How many waysTime Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1458 Accepted Submission(s): 904Problem Description这是一个简单原创 2012-10-18 23:14:19 · 305 阅读 · 0 评论 -
hdu 2084 数塔
题目描述:数塔Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 11593 Accepted Submission(s): 6969Problem Description在讲述DP算法的时候,一个经典原创 2012-10-19 00:01:24 · 323 阅读 · 0 评论 -
hdu 2059 龟兔赛跑
题目描述:龟兔赛跑Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 7149 Accepted Submission(s): 2744Problem Description据说在很久很久以前,可怜的兔原创 2012-10-18 23:52:58 · 438 阅读 · 0 评论 -
hdu 2159 FATE
题目描述:FATETime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4124 Accepted Submission(s): 1843Problem Description最近xhd正在玩一款叫做FA原创 2012-10-19 00:14:43 · 319 阅读 · 0 评论 -
hdu 1864 最大报销额
题目描述:最大报销额Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 11009 Accepted Submission(s): 3010Problem Description现有一笔经费可以报销一定原创 2012-10-19 20:39:49 · 318 阅读 · 0 评论 -
hdu 2602 Bone Collector
题目描述:Bone CollectorTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 14889 Accepted Submission(s): 5911Problem DescriptionMan原创 2012-10-19 18:29:52 · 320 阅读 · 0 评论 -
Ural 1371. Cargo Agency
The author is lazy..Code :#include#include#include#include#include#includeusing namespace std;#define sf scanf#define pf printf#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)#def原创 2013-11-27 11:49:13 · 714 阅读 · 0 评论