ACM-区间DP
fzw_captain
hold on tight
展开
-
ZOJ 3537 Cake 凸包+区间DP+记忆化搜索
Cake -------------------------------------------------------------------------------- Time Limit: 1 Second Memory Limit: 32768 KB ------------------------------------------------------------原创 2015-08-14 19:17:51 · 394 阅读 · 0 评论 -
POJ 2955 brackets
Brackets Time Limit: 1000MS Memory Limit: 65536K Description We give the following inductive definition of a “regular brackets” sequence: the empty sequence is a regular brackets sequence, if原创 2015-08-13 20:31:37 · 271 阅读 · 0 评论 -
LightOJ - 1422 Halloween Costumes 区间DP
Halloween Costumes Time Limit: 2000MS Memory Limit: 32768KB 64bit IO Format: %lld & %llu Description Gappu has a very busy weekend ahead of him. Because, next weekend is Halloween, and he is plan原创 2015-08-19 16:53:38 · 482 阅读 · 0 评论 -
HDU 5115 Dire Wolf 区间DP+记忆化搜索
Dire Wolf Time Limit: 5000/5000 MS (Java/Others) Memory Limit: 512000/512000 K (Java/Others) Total Submission(s): 749 Accepted Submission(s): 438 Problem Description Dire wolves, also known原创 2015-08-20 16:05:13 · 336 阅读 · 0 评论 -
BUN16 51640 dp
bunoj %Q #include #include #include #include using namespace std; const int maxn = 1000+100 ; long long a[maxn] ; long long dp[1000][1000] ; int main() { int t , n , m ; scanf("%d",原创 2016-06-10 23:03:45 · 278 阅读 · 0 评论 -
UVa10003 cutting sticks
区间dp,基本裸题 dp[i][j] = dp[i][k] + dp[k][j] + val(j-i) ; 枚举给定的点即可#include <iostream> #include <cstdio> #include <cstring> #include <cstdlib> #define min(a,b) (a<b?a:b) #define FOR(a,i,b) for( i = a ; i原创 2016-07-15 17:57:06 · 324 阅读 · 0 评论