#include <iostream>
#include <bits/stdc++.h>
using namespace std;
#define MAX 1001
int main()
{
int a[MAX][MAX];
int n;
cin >> n;
for(int i = 1;i <= n;i++){
for(int j = 1;j <= n;j++){
cin >> a[i][j];
}
}
int dp[n+1][n+1] = {-1};
for(int i = 1;i <= n;i++){
for(int j = 1;j <= n;j++){
dp[i][j] = max(dp[i][j],max(dp[i-1][j],dp[i][j-1]));
}
}
cout << dp[n][n] << endl;
return 0;
}
矩阵取数游戏
最新推荐文章于 2024-02-05 17:46:00 发布