DP
文章平均质量分 76
Clearle
我就是要证明给你看!
展开
-
UVA 10635 Prince and Princess 最长公共子序列
Prince and PrincessInput: Standard InputOutput: Standard OutputTime Limit: 3 Seconds In an n x n chessboard, Prince and Princess plays a game. The squares in the chessboard are numbered 1,原创 2013-08-28 19:29:28 · 808 阅读 · 0 评论 -
UVA 1456 Cellular Network 贪心+概率dp
Cellular NetworkTime Limit:3000MS Memory Limit:0KB 64bit IO Format:%lld & %lluSubmit StatusAppoint description: System Crawler (2013-05-30)DescriptionA cellular ne原创 2013-10-30 19:42:29 · 524 阅读 · 0 评论 -
UVA 11795 Mega Man's Mission
Mega Man's MissionTime Limit:1000MS Memory Limit:0KB 64bit IO Format:%lld & %lluSubmit StatusAppoint description: System Crawler (2013-05-30)Description B原创 2013-11-05 20:02:37 · 585 阅读 · 0 评论 -
HDU 1024 Max Sum Plus Plus
Max Sum Plus PlusTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 14214 Accepted Submission(s): 4658Problem DescriptionNow I t原创 2013-11-11 20:12:09 · 752 阅读 · 0 评论 -
poj 2479 Maximum sum 两段不相交最大子段和
Maximum sumTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 31315 Accepted: 9595DescriptionGiven a set of n integers: A={a1, a2,..., an}, we define a fun原创 2013-11-26 16:42:25 · 908 阅读 · 0 评论 -
HDU 1466 计算直线的交点数
计算直线的交点数Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 7456 Accepted Submission(s): 3315Problem Description平面上有n条直线,且无三线共点,问原创 2013-12-03 17:39:42 · 621 阅读 · 0 评论 -
codeforces 208C Police Station
http://codeforces.com/problemset/problem/208/C先算出最短路路径数和距离,然后枚举每个点i分别求到1和n的路径数,相乘就是经过点i的总路径数,然后计算下就行了#include #include #include #include #include #include #include #include #includ原创 2014-03-11 20:52:30 · 832 阅读 · 0 评论 -
HDU 3768 Shopping 最短路+状压dp
dp[j][i] 表示在第j个商店,i表示是否去过商店的状态#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #inc原创 2014-03-15 18:20:21 · 506 阅读 · 0 评论 -
POJ 1141 Brackets Sequence 区间dp
递归输出下就行了#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #inclu原创 2014-05-14 15:15:48 · 433 阅读 · 0 评论 -
POJ 1014 Dividing dfs
大致题意:给你一些有价值的弹珠,这些弹珠的价值分为6种,即1,2,3,4,5,6,问你是否能分成两份,两份的弹珠价值总和要相等,价值总和为奇数时一定不可分,总和为偶数时dfs一下,额,背包的话想了半天没想出来。。。原创 2014-07-18 10:57:06 · 479 阅读 · 0 评论 -
HDU 4939 Stupid Tower Defense dp
Stupid Tower DefenseTime Limit: 12000/6000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 381 Accepted Submission(s): 91Problem DescriptionFSF i原创 2014-08-12 20:06:41 · 484 阅读 · 0 评论 -
UVA 11552 Fewest Flops 多维dp
Fewest FlopsTime Limit:2000MS Memory Limit:0KB 64bit IO Format:%lld & %lluSubmit StatusAppoint description: System Crawler (2013-05-30)DescriptionProblem FFEWE原创 2013-10-29 20:58:56 · 573 阅读 · 0 评论 -
UVA 10534 Wavio Sequence 最长上升子序列
Wavio SequenceTime Limit:3000MS Memory Limit:0KB 64bit IO Format:%lld & %lluSubmit StatusAppoint description: System Crawler (2013-10-12)DescriptionProblem DWavio Sequ原创 2013-10-28 20:52:12 · 470 阅读 · 0 评论 -
UVA 11584 Partitioning by Palindromes 回文串dp
Partitioning by PalindromesTime Limit:1000MS Memory Limit:0KB 64bit IO Format:%lld & %lluSubmit StatusAppoint description: System Crawler (2013-05-30)DescriptionPr原创 2013-10-28 19:38:18 · 635 阅读 · 0 评论 -
UVA 10891 Game of Sum 记忆化搜索
Game of SumInput File: e.inOutput: Standard Output This is a two player game. Initially there are n integer numbers in an array and players A and B get chance to take them alternatively. Each原创 2013-08-29 17:27:42 · 510 阅读 · 0 评论 -
poj 3624 Charm Bracelet 基础01背包
Charm BraceletTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 17801 Accepted: 8117DescriptionBessie has gone to the mall's jewelry store and spies a cha原创 2013-08-29 19:04:00 · 545 阅读 · 0 评论 -
poj 2923 Relocation 状态压缩+01背包
RelocationTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 1626 Accepted: 657DescriptionEmma and Eric are moving to their new house they bought after ret原创 2013-09-05 20:24:17 · 488 阅读 · 0 评论 -
poj 2063 Investment 多次完全背包
InvestmentTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 6969 Accepted: 2422DescriptionJohn never knew he had a grand-uncle, until he received the nota原创 2013-09-06 16:52:30 · 471 阅读 · 0 评论 -
poj 3211 Washing Clothes 01背包
Washing ClothesTime Limit: 1000MS Memory Limit: 131072KTotal Submissions: 8157 Accepted: 2530DescriptionDearboy was so busy recently that now he has piles of clot原创 2013-09-03 16:33:26 · 622 阅读 · 0 评论 -
poj 1745 Divisibility dp
DivisibilityTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 9693 Accepted: 3380DescriptionConsider an arbitrary sequence of integers. One can place + or原创 2013-09-03 19:00:38 · 544 阅读 · 0 评论 -
poj 1976 A Mini Locomotive 01背包
A Mini LocomotiveTime Limit:1000MS Memory Limit:30000KB 64bit IO Format:%I64d & %I64uSubmit StatusAppoint description: System Crawler (2013-05-30)DescriptionA train原创 2013-09-03 21:39:10 · 556 阅读 · 0 评论 -
poj 1837 Balance 01背包
BalanceTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 9206 Accepted: 5650DescriptionGigel has a strange "balance" and he wants to poise it. Actually, t原创 2013-09-04 16:19:15 · 536 阅读 · 0 评论 -
poj 3628 Bookshelf 2 01背包
Bookshelf 2Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 6658 Accepted: 3072DescriptionFarmer John recently bought another bookshelf for the cow libra原创 2013-09-04 14:14:10 · 537 阅读 · 0 评论 -
poj 1948 Triangular Pastures 二维01背包
Triangular PasturesTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 5788 Accepted: 1854DescriptionLike everyone, cows enjoy variety. Their current fancy原创 2013-09-05 16:32:13 · 506 阅读 · 0 评论 -
Codeforces Round #267 (Div. 2) C George and Job 水dp
George and Jobtime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputThe new ITone 6 has been released recently an原创 2014-09-24 20:45:45 · 904 阅读 · 0 评论