C++博客-mringg的天空，自由，自在-随笔分类-动态规划http://www.cppblog.com/mringg/category/12866.htmlzh-cnWed, 10 Feb 2010 09:41:38 GMTWed, 10 Feb 2010 09:41:38 GMT60NOIP2008 传纸条http://www.cppblog.com/mringg/archive/2010/02/09/107597.htmlmringgmringgTue, 09 Feb 2010 07:59:00 GMThttp://www.cppblog.com/mringg/archive/2010/02/09/107597.htmlhttp://www.cppblog.com/mringg/comments/107597.htmlhttp://www.cppblog.com/mringg/archive/2010/02/09/107597.html#Feedback0http://www.cppblog.com/mringg/comments/commentRss/107597.htmlhttp://www.cppblog.com/mringg/services/trackbacks/107597.html 1#include<cstdio>
 2#include<cstring>
 3#include<iostream>
 4using namespace std;
 5
 6const int dir[2][4]={{-1,-1,0,0},{-1,0,-1,0}};
 7int F[120][60][60],a[60][60];
 8int n,m;
 9int Max(int x,int y)
10{
11    if (x>y) return x;
12    else return y;
13}
14int Min(int x,int y)
15{
16    if (x>y) return y;
17    else return x;
18}
19int main()
20{
21    scanf("%d%d",&n,&m);
22    for (int i=1;i<=n;i++)
23        for (int j=1;j<=m;j++)
24            scanf("%d",&a[i][j]);
25    memset(F,0,sizeof(F));
26    int x;
27    for (int k=2;k<=n+m;k++)
28        for (int i1=1;i1<=Min(n,k-1);i1++)
29            for (int i2=1;i2<=Min(n,k-1);i2++)
30            {
31                x=a[i1][k-i1]+a[i2][k-i2];
32                if (i1==i2) x=a[i1][k-i1];
33                for (int i=0;i<=3;i++)
34                    F[k][i1][i2]=Max(F[k][i1][i2],F[k-1][i1+dir[0][i]][i2+dir[1][i]]);
35                F[k][i1][i2]+=x;
36            }
37    printf("%d\n",F[n+m][n][n]);
38    return 0;
39}
40

mringg 2010-02-09 15:59 发表评论
]]>采药http://www.cppblog.com/mringg/archive/2010/02/09/107596.htmlmringgmringgTue, 09 Feb 2010 07:58:00 GMThttp://www.cppblog.com/mringg/archive/2010/02/09/107596.htmlhttp://www.cppblog.com/mringg/comments/107596.htmlhttp://www.cppblog.com/mringg/archive/2010/02/09/107596.html#Feedback0http://www.cppblog.com/mringg/comments/commentRss/107596.htmlhttp://www.cppblog.com/mringg/services/trackbacks/107596.html 1#include<iostream> 
 2using namespace std; 
 3int main()
 4{ 
 5    int time=0,num=0,mtime[1001]={},mmoney[101]={},f[10001]={};
 6    cin>>time>>num;
 7    for(int i=1;i<=num;i++)
 8    {
 9     cin>>mtime[i]>>mmoney[i];
10    }
11    for(int i=1;i<=num;i++)
12    {
13     for(int j=time;j>=mtime[i];j--)
14     {
15             f[j]=max(f[j],f[j-mtime[i]]+mmoney[i]);
16     } 
17    } 
18    cout<<f[time]<<endl;
19    system ("pause");
20    return 0; 
21} 
22

mringg 2010-02-09 15:58 发表评论
]]>