NBUT 1456 Orianna (DP)

[1456] Orianna

时间限制: 1000 ms　内存限制: 65535 K

问题描述

Orianna is the lady of clockwork that fights in League of Legends. She fights with her ball.

#pragma comprint(linker, "/STACK:1024000000,1024000000")
#include<cstdio>
#include<string>
#include<iostream>
#include<cstring>
#include<cmath>
#include<stack>
#include<queue>
#include<vector>
#include<map>
#include<stdlib.h>
#include<time.h>
#include<algorithm>
#define LL __int64
#define FIN freopen("in.txt","r",stdin)
using namespace std;
const int MAXN=100000+5;
const int INF=0x3f3f3f3f;
int dp[MAXN][6][2];
int a[10+5][MAXN];
int main()
{
int n;
while(scanf("%d",&n)!=EOF)
{
memset(dp,0,sizeof(dp));
for(int i=1;i<=5;i++)
{
for(int j=1;j<=n;j++)
scanf("%d",&a[i][j]);
}
for(int i=1;i<=5;i++)
{
dp[1][i][0]=dp[1][i][1]=a[i][1];
}
for(int i=2;i<=n;i++)
{
for(int j=1;j<=5;j++)//枚举本次球的编号
{
for(int k=1;k<=5;k++)//枚举上次球的编号
{
if(k>j)
{
dp[i][j][0]=max(dp[i][j][0],dp[i-1][k][1]+a[j][i]);
}
else if(k<j)
{
dp[i][j][1]=max(dp[i][j][1],dp[i-1][k][0]+a[j][i]);

}
}
}
}
int ans=-INF;
for(int i=1;i<=5;i++)
{
ans=max(ans,max(dp
[i][1],dp
[i][0]));
}
printf("%d\n",ans);
}
return 0;
}

View Code