动态规划
shuangyueliao
这个作者很懒,什么都没留下…
展开
-
排队买票
http://114.215.99.34/#//1103#include#includeusing namespace std;int main(){ int m,n,k; cin>>m>>n>>k; if(n cout else { int s1=1; for(in原创 2016-05-06 22:56:48 · 459 阅读 · 0 评论 -
整数划分(四)
http://acm.nyist.net/JudgeOnline/problem.php?pid=746#include#includeusing namespace std;long long a[30][30];char n[30];int max(int x,int y){ return x>y?x:y;}void area(int x,int原创 2015-04-21 22:12:50 · 339 阅读 · 0 评论 -
“炫舞家“ST
http://acm.nyist.net/JudgeOnline/problem.php?pid=740//操作比较繁琐的dp,思路理清就好理解了#include #include int dp[10001][5][5], step[10001];int cost[5][5] = {{1, 2, 2, 2, 2}, {2, 1, 3, 4, 3}, {2, 3,原创 2015-04-15 20:10:50 · 375 阅读 · 0 评论 -
蚂蚁的难题(二)
http://acm.nyist.net/JudgeOnline/problem.php?pid=745#include#includeusing namespace std;long long a[50010];long long dp[50010],dp1[50010];int main(){ int n,i; long long sum,ans,a原创 2015-04-19 22:16:24 · 425 阅读 · 0 评论 -
擅长排列的小明 II
http://blog.csdn.net/dgq8211/article/details/7369079转载 2015-04-11 16:44:53 · 305 阅读 · 0 评论 -
钉子和小球
http://poj.org/problem?id=1189#includeusing namespace std;char a[60][60];long long result[60][60];long long gcd(long long x,long long y){ if(y==0) return x; else return gcd(y,x原创 2015-04-05 17:11:26 · 395 阅读 · 0 评论 -
石头合并
http://blog.csdn.net/abcjennifer/article/details/5805330转载 2015-03-29 20:36:36 · 435 阅读 · 0 评论 -
To the Max
http://poj.org/problem?id=1050#include#includeusing namespace std;int n;int DP(int x[]){ int max,dp[110],i; dp[0]=x[0]; for(i=1;i { if(dp[i-1]>0) dp[i]=dp[i-1]+x[i];原创 2015-03-24 13:32:01 · 345 阅读 · 0 评论 -
Moving Tables
http://acm.hdu.edu.cn/showproblem.php?pid=1050#include#includeusing namespace std;int main(){ int t,n,i,j,a,b,c[200],temp,max; cin>>t; while(t--) { memset(c,0,sizeof(c)); c原创 2015-03-18 15:00:34 · 421 阅读 · 0 评论 -
整数因子分解问题
http://blog.sina.com.cn/s/blog_9b95c19e0101aqw9.html转载 2015-04-24 20:10:35 · 488 阅读 · 0 评论 -
数字三角形
http://blog.csdn.net/sdjzping/article/details/9720941转载 2015-06-21 23:58:56 · 350 阅读 · 0 评论 -
数字游戏
http://114.215.99.34/#//1016#include#includeusing namespace std;int n,m,Max,Min,s[55],d[55][10],dp[55][10];void DP(int a[]){ int i,j,k; for(i=1;i s[i]=s[i-1]+a[i];原创 2016-05-05 23:41:33 · 244 阅读 · 0 评论 -
NOIP2007守望者的逃离
#include#includeusing namespace std;int a[300010];int max(int x,int y){ return x>y?x:y;}int main(){ int m,s,t,i; memset(a,0,sizeof(a)); cin>>m>>s>>t; for(i=1原创 2016-03-27 16:13:43 · 350 阅读 · 0 评论 -
Worm
http://acm.hdu.edu.cn/showproblem.php?pid=2151#include#include#includeusing namespace std;int main(){ int n,p,m,t; int dp[110][110]; while(scanf("%d%d%d%d",&n,&p,&m,&t)!=E原创 2015-09-12 21:59:10 · 447 阅读 · 0 评论 -
FatMouse's Speed
http://acm.hdu.edu.cn/showproblem.php?pid=1160#include#include#include#includeusing namespace std;struct Mice{int m,v,num;}mice[1010];int pre[1010];int dp[1010],res[1010];boo原创 2015-08-20 23:24:59 · 352 阅读 · 0 评论 -
算法分析与设计矩阵连乘问题
http://www.it165.net/pro/html/201505/39915.html转载 2015-06-27 16:28:20 · 644 阅读 · 0 评论 -
动态规划--凸多边形最优三角剖分
http://www.cnblogs.com/Jason-Damon/p/3298172.html原创 2015-06-27 18:25:58 · 613 阅读 · 0 评论 -
矩形嵌套
http://acm.nyist.net/JudgeOnline/problem.php?pid=16#include#includeusing namespace std;int G[1010][1010],vis[1010],n;int deal(int x){ if(vis[x]>0) return vis[x]; vis[x]=1; int原创 2015-06-24 12:03:50 · 389 阅读 · 0 评论 -
DAG模型硬币问题
#include#includeusing namespace std;int v[1010],d[1010],vis[1010],n;int max(int x,int y){ return x>y?x:y;}int min(int x,int y){ return x}int dmin(int s){ int &ans=d[s];原创 2015-06-24 15:17:00 · 860 阅读 · 0 评论 -
Communication System
http://poj.org/problem?id=1018#include#includeusing namespace std;int main(){ int i,j,k,t,n,m[110],high,low,b[110][110],p[110][110],price,total; double ans; cin>>t; while(t--)原创 2015-03-23 13:42:04 · 348 阅读 · 0 评论 -
LITTLE SHOP OF FLOWERS
http://poj.org/problem?id=1157#include#include#define max(x,y) x>y?x:yusing namespace std;int main(){ int n,m,dp[110][110],a[110][110],i,j,k,t; while(cin>>n>>m) { for(i=0;i f原创 2015-03-28 13:17:28 · 440 阅读 · 0 评论 -
最长公共子序列
http://acm.nyist.net/JudgeOnline/problem.php?pid=36#include#include#include#define max(x,y) (x>y?x:y)int dp[1010][1010];using namespace std;int main(){ int n,i,j,a1,b1; char a[1010原创 2015-03-22 22:17:48 · 306 阅读 · 0 评论 -
搬寝室
http://acm.hdu.edu.cn/showproblem.php?pid=1421#include#include#define min(x,y) x>y?y:xint dp[2001][2001];int main(){ int n,k,i,j,a[2001],t; while(scanf("%d%d",&n,&k)!=EOF) { f原创 2015-02-07 23:37:13 · 312 阅读 · 0 评论 -
How to Type
http://acm.hdu.edu.cn/showproblem.php?pid=2577#include#include#define min(x,y) xint main(){ int n,i,j,dp[110][2],status,count; char a[110]; scanf("%d",&n); getchar(); while(n--原创 2015-02-06 00:26:59 · 386 阅读 · 0 评论 -
Beans
http://acm.hdu.edu.cn/showproblem.php?pid=2845#includeint dp[200010],a[200010],b[200010];#define max(x,y) x>y?x:yint main(){ int n,m,i,j; while(scanf("%d%d",&n,&m)!=EOF) { dp[0]原创 2015-02-06 17:09:03 · 313 阅读 · 0 评论 -
Monkey and Banana
http://acm.hdu.edu.cn/showproblem.php?pid=1069#include#include#define max(x,y) x>y?x:yint main(){ int num,t,i,j,k,a[3],count,maxsum[1000],max,sum,f=0; struct block { int x; i原创 2015-02-04 23:28:30 · 358 阅读 · 0 评论 -
命运
http://acm.hdu.edu.cn/showproblem.php?pid=2571#include#include#define max(x,y) x>y?x:yint main(){ int num,a[25][1010],n,m,i,j,sum[25][1010],k; scanf("%d",&num); while(num--) {原创 2015-02-04 18:22:28 · 337 阅读 · 0 评论 -
City Game
http://acm.hdu.edu.cn/showproblem.php?pid=1505#include#includeint a[1010][1010],l[1010],r[1010];int main(){ int j,n,m,i,num,max,res; char t[10]; scanf("%d",&num); while(num--)原创 2015-02-03 18:49:31 · 450 阅读 · 0 评论 -
Largest Rectangle in a Histogram4 1000 1000 1000 1000
http://acm.hdu.edu.cn/showproblem.php?pid=1506#include#include__int64 a[100010];__int64 s[100010],e[100010],ans,temp;int main(){ int n,i; while(scanf("%d",&n),n) { for(i=0;i原创 2015-02-03 00:00:31 · 396 阅读 · 0 评论 -
最大连续子序列http://acm.hdu.edu.cn/showproblem.php?pid=1231
http://acm.hdu.edu.cn/showproblem.php?pid=1231#include#include#define max(x,y) x>y?x:yint main(){ int i,n,a[10010],dp[10010],begin[10010],max,sign; while(scanf("%d",&n),n) { for原创 2015-02-01 23:29:26 · 524 阅读 · 0 评论 -
Matrix Swapping II
http://acm.hdu.edu.cn/showproblem.php?pid=2830#include #include #include using namespace std;int cmp(int a,int b){ return a>b;}int main(){ int n,m,i,j,k,t,ans,num[1010],ro原创 2015-02-07 00:10:25 · 418 阅读 · 0 评论 -
Common Subsequence经典DP,最长公共子序列
http://acm.hdu.edu.cn/showproblem.php?pid=1159#include#include#define max(x,y) x>y?x:yint dp[1000][1000];int main(){ char a[1000],b[1000]; int i,j,a1,b1; while(scanf("%s%s",a,b)!原创 2015-02-07 16:46:49 · 529 阅读 · 0 评论 -
VF
http://acm.nyist.net/JudgeOnline/status.php?pid=269#include#includeusing namespace std;int main(){ int i,j,k,s,dp[10][82],sum; memset(dp,0,sizeof(dp)); for(i=1;i dp[1][i]=1; f原创 2015-03-21 17:57:19 · 906 阅读 · 1 评论 -
最大的数
http://acm.nyist.net/JudgeOnline/problem.php?pid=1170#includeusing namespace std;int a[10010];void add(int l,int r){ if(a[l]==2) { a[l]++; return ; }原创 2015-03-16 22:55:05 · 336 阅读 · 0 评论 -
呵呵滑雪
http://poj.org/problem?id=1088#include#includeusing namespace std;int h[10010][150]={0},h1[10010][150],c[10010]={0};int main(){ int n,m,t,a[110][110],dp[110][110],i,j,l,max,row,col,m原创 2015-03-25 15:54:17 · 332 阅读 · 0 评论 -
Max Sum Plus Plus
http://acm.hdu.edu.cn/showproblem.php?pid=1024http://www.cnblogs.com/kuangbin/archive/2011/08/04/2127085.html转载 2015-02-14 23:57:00 · 445 阅读 · 0 评论 -
Super Jumping! Jumping! Jumping!
http://acm.hdu.edu.cn/showproblem.php?pid=1087//居然没超时#include#includeint dp[5000000];int main(){ int n,a[1010],i,j,max; while(scanf("%d",&n),n) { for(i=0;i scanf("%d",a+i)原创 2015-02-03 20:53:47 · 411 阅读 · 0 评论 -
How many ways
http://acm.hdu.edu.cn/showproblem.php?pid=1978#include#includeint main(){ int map[130][130],n,m,i,j,k,l,temp,t; scanf("%d",&t); while(t--) { scanf("%d%d",&n,&m); memset(map,0原创 2015-02-08 20:20:20 · 300 阅读 · 0 评论 -
Largest Submatrix
http://acm.hdu.edu.cn/showproblem.php?pid=2870#include#includeint a[1010][1010],b[1010][1010],c[1010][1010],l[1010],r[1010];int main(){ int n,m,i,j,area; char ch; while(scanf("%d%d原创 2015-02-06 19:51:24 · 676 阅读 · 0 评论 -
Humble Numbers
http://acm.hdu.edu.cn/showproblem.php?pid=1058#include#define min(a,b) (a>b?b:a)#define min4(a,b,c,d) min(min(a,b),min(c,d))int a[6000];int main(){ int n=1,p2=1,p3=1,p5=1,p7=1; a[1原创 2015-02-08 18:06:36 · 315 阅读 · 0 评论