hdu 1176 免费馅饼 dp

dp[i][j]=max(dp[i-1][j-1],dp[i-1][j],dp[i-1][j-1]);

如果这个位置能接到馅饼,则还要加上现在接的：dp[i][j]+=vis[i][j];

dp[i][j]表示第i秒j位置最多的馅饼数

View Code

#include <cstdio>
#include <algorithm>

using namespace std;

int vis[100005][15],dp[100005][15];

int main()
{
int i,j,n,x,t,time,ans;
while(scanf("%d",&n)&&n)
    {
        memset(vis,0,sizeof(vis));
        memset(dp,0,sizeof(dp));
        time=0;
for (i=0;i<n;i++)
        {
            scanf("%d%d",&x,&t);
            vis[t][x+1]++;
if(t>time)time=t;
        }
        ans=0;
for (i=1;i<=time;i++)
        {
for (j=1;j<=11;j++)
            {
                dp[i][j]=max(dp[i-1][j],max(dp[i-1][j-1],dp[i-1][j+1]));
if(vis[i][j]&&j>=6-i&&6+i>=j)
                {
                    dp[i][j]+=vis[i][j];
                }
if(dp[i][j]>ans)ans=dp[i][j];
            }    
        }
        printf("%d\n",ans);
    }
return 0;
}

转载于:https://www.cnblogs.com/104-gogo/archive/2011/11/09/2242509.html