Relay Race CodeForces - 214E [DP]
Furik and Rubik take part in a relay race. The race will be set up on a large square with the side of n meters. The given square is split into n × n cells (represented as unit squares), each cell has some number.
At the beginning of the race Furik stands in a cell with coordinates (1, 1), and Rubik stands in a cell with coordinates (n, n). Right after the start Furik runs towards Rubik, besides, if Furik stands at a cell with coordinates (i, j), then he can move to cell (i + 1, j) or (i, j + 1). After Furik reaches Rubik, Rubik starts running from cell with coordinates (n, n) to cell with coordinates (1, 1). If Rubik stands in cell (i, j), then he can move to cell (i - 1, j) or (i, j - 1). Neither Furik, nor Rubik are allowed to go beyond the boundaries of the field; if a player goes beyond the boundaries, he will be disqualified.
To win the race, Furik and Rubik must earn as many points as possible. The number of points is the sum of numbers from the cells Furik and Rubik visited. Each cell counts only once in the sum.
Print the maximum number of points Furik and Rubik can earn on the relay race.
The first line contains a single integer (1 ≤ n ≤ 300). The next n lines contain n integers each: the j-th number on the i-th line ai, j( - 1000 ≤ ai, j ≤ 1000) is the number written in the cell with coordinates (i, j).
On a single line print a single number — the answer to the problem.
1
5
5
2
11 14
16 12
53
3
25 16 25
12 18 19
11 13 8
136
Comments to the second sample: The profitable path for Furik is: (1, 1), (1, 2), (2, 2), and for Rubik: (2, 2), (2, 1), (1, 1).
Comments to the third sample: The optimal path for Furik is: (1, 1), (1, 2), (1, 3), (2, 3), (3, 3), and for Rubik: (3, 3), (3, 2), (2, 2), (2, 1), (1, 1). The figure to the sample:
dp[i][x][step]=max(dp[i][x][step],dp[i-1][x-1][step-1]+a[i][j]+a[x][y]);
dp[i][x][step]=max(dp[i][x][step],dp[i][x-1][step-1]+a[i][j]+a[x][y]);
dp[i][x][step]=max(dp[i][x][step],dp[i-1][x][step-1]+a[i][j]+a[x][y]);
dp[i][x][step]=max(dp[i][x][step],dp[i][x][step-1]+a[i][j]+a[x][y]);
if(i==x && j==y) dp[i][x][step]-=a[i][j];
答案即为 dp[n][n][2*n-2];
复杂度为O(n*n*(2n)) = 5.4*10^7
#include <bits/stdc++.h>
#define INF 0x3f3f3f3f
#define MOD 1000000007
#define bug1 cout <<"bug1"<<endl
#define bug2 cout <<"bug2"<<endl
#define bug3 cout <<"bug3"<<endl
using namespace std;
typedef long long ll;
const int MAX_N=300+5;
int a[MAX_N][MAX_N];
int dp[MAX_N][MAX_N][2*MAX_N+50];
int main(void){
int n;
cin >>n ;
for(register int i=1;i<=n;i++)
for(int j=1;j<=n;j++) scanf("%d",&a[i][j]);
for(register int i=0;i<=n;i++)
for(register int j=0;j<=n;j++)
for(register int step=0;step<=2*n;step++) dp[i][j][step]=-INF;
dp[1][1][0]=a[1][1];
for(register int i=1;i<=n;i++){
for(register int x=1;x<=n;x++){
for(register int step=0;step<=2*n-1;step++){
int j=step-i+2;
int y=step-x+2;
// if(i==1 &&j==1) continue;
// if(x==1 && y==1) continue;
if(j>=1&&j<=n&&y>=1&&y<=n ){
dp[i][x][step]=max(dp[i][x][step],dp[i-1][x-1][step-1]+a[i][j]+a[x][y]);
dp[i][x][step]=max(dp[i][x][step],dp[i][x-1][step-1]+a[i][j]+a[x][y]);
dp[i][x][step]=max(dp[i][x][step],dp[i-1][x][step-1]+a[i][j]+a[x][y]);
dp[i][x][step]=max(dp[i][x][step],dp[i][x][step-1]+a[i][j]+a[x][y]);
if(i==x && j==y) dp[i][x][step]-=a[i][j];
cout << "i="<<i<<"j="<<j<<" "<<"step="<<step<<" "<<dp[1][1][0] << endl;
}
}
}
}
//cout <<"******"<<endl;
cout <<dp[n][n][2*n-2] << endl;
}
投递小鹏汽车等公司7个岗位
