DP
文章平均质量分 65
紫杉丶
这个作者很懒,什么都没留下…
展开
-
HDU 1231 最大连续子序列(DP入门)
~~传送门:http://acm.hdu.edu.cn/showproblem.php?pid=1231最大连续子序列 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 20626 Accepted Submission(s): 9原创 2015-02-06 21:21:02 · 389 阅读 · 0 评论 -
POJ 3186 Treats for the Cows (DP)
从里到外逆推//#pragma commmpnt(linkmpr, "/STACK:102400000,102400000")#include #include #include #include #include #include using namespace std;typedef long long LL;const int M = 100010;const int原创 2015-10-08 21:33:22 · 395 阅读 · 0 评论 -
POJ 2533 Longest Ordered Subsequence (LIS)
最长上升子序列O(n*logn)//#pragma commmpnt(linkmpr, "/STACK:102400000,102400000")#include #include #include #include #include #include using namespace std;typedef long long LL;const int M = 10001原创 2015-10-07 19:30:36 · 268 阅读 · 0 评论 -
HDU 1159 Common Subsequence(最长公共子序列)
#include "string"#include "iostream"#include "cstdio"#include "cmath"#include "set"#include "queue"#include "vector"#include "cctype"#include "sstream"#include "cstdlib"#include "c原创 2015-03-19 20:01:12 · 273 阅读 · 0 评论 -
HDU 1114 Piggy-Bank (完全背包)
完全背包for i=[0,n) for(j=weight[i]; j tab[j] = max(tab[j-weight[i]]+value[i],tab[j])//#include #include #include #include using namespace std;typedef long long LL;const int原创 2015-10-06 21:47:53 · 250 阅读 · 0 评论 -
HDU 1160 FatMouse's Speed(DP)
//#pragma commmpnt(linkmpr, "/STACK:102400000,102400000")#include #include #include #include #include #include using namespace std;typedef long long LL;const int M = 100010;const int INF =0x原创 2015-10-07 18:46:56 · 264 阅读 · 0 评论 -
HDU 1428 漫步校园(Spfa+记忆化搜索)
#include#include#include#include#include#includeusing namespace std;typedef long long LL;const int M = 10000;const int INF = 0x3f3f3f3f;int n;int dir[][2] = { 1,0,-1,0,0,-1,0,1 };int mp[5原创 2015-10-20 21:01:09 · 357 阅读 · 0 评论 -
POJ 3616 Milking Time(DP)
dp[i]= i-1时间段产奶量 + 现在的产奶量#include#include#include#include#includeusing namespace std;typedef long long LL;const int M = 10000;const int INF = 0x3f3f3f3f;struct node{ int st, et, w; boo原创 2015-10-18 21:05:32 · 278 阅读 · 0 评论 -
HDU 1078 FatMouse and Cheese (记忆化搜索)
#include#include#include#include#includeusing namespace std;typedef long long LL;const int M = 10000;const int INF = 0x3f3f3f3f;int n, k;int dir[][2] = { 1,0,-1,0,0,1,0,-1 };int dp[105][10原创 2015-10-19 19:30:30 · 219 阅读 · 0 评论 -
HDU 2859 Phalanx(DP)
基础DP#include#include#include#include#includeusing namespace std;typedef long long LL;const int M = 10000;const int INF = 0x3f3f3f3f;string s[1050];int dp[1050][1050];//char s[1050][1050]原创 2015-10-18 19:48:39 · 295 阅读 · 0 评论 -
HDU 4705 Y (树形DP)
思路:反面考虑,用总的方案数减去A,B,C三点在同一路径上的方案数。于是我们可以确定中间点B,在当前以B为根求得的son中任选一个,在剩下的节点n-tmp-1(tmp为已经求得的B的儿子的个数)中任选一个,产生tmp*(n-tmp-1)中组合。//#pragma comment(linker, "/STACK:102400000,102400000")#pragma comment(link原创 2015-08-20 19:55:29 · 316 阅读 · 0 评论 -
HDU 3998 Sequence
求最长上升子序列的长度以及个数,由于数据水,可以直接找 正解是DP+网络流#include "cstring"#include "iostream"#include "algorithm"#include "cstdio"#include "queue"#include "set"using namespace std;typedef long long LL;const i原创 2015-07-19 21:13:46 · 264 阅读 · 0 评论 -
最长上升子序列 模板
int a[M],b[M];int search(int num,int low,int high){ int mid; while(low<=high) { mid=(low+high)/2; if(num>=b[mid]) low=mid+1; else high=mid原创 2015-07-19 18:37:09 · 561 阅读 · 0 评论 -
HDU 2059 龟兔赛跑 (DP)
龟兔赛跑Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 12597 Accepted Submission(s): 4735Problem Description据说在很久很久以前,可怜的兔子经历了人生中最原创 2015-03-05 19:06:48 · 370 阅读 · 0 评论 -
POJ 1661 Help Jimmy (DP)
dp[i][j], j = 0, 1 (dp[i][0]表示以i号平台左边为起点到地面的最短时间,dp[i][1]]表示以i号平台右边为起点到地面的最短时间)状态转移方程:dp[i][0] = H[i] - H[m] + Min (dp[m][0] + X1[i] - X1[m], dp[m][1] + X2[m] - X1[i]); m为i左边下面的平台的编号dp[i][1]原创 2015-10-10 21:06:45 · 283 阅读 · 0 评论