#include <iostream>
#include <istream>
#include <sstream>
#include <vector>
#include <stack>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <cstring>
#include <unordered_map>
#include <unordered_set>
#include <algorithm>
#include <numeric>
#include <chrono>
#include <ctime>
#include <cmath>
#include <cctype>
#include <string>
#include <cstdio>
#include <iomanip>
#include <thread>
#include <mutex>
#include <condition_variable>
#include <functional>
#include <iterator>
using namespace std;
const int maxn = 505;
int n, m,a[maxn][maxn],b[maxn][maxn],dp[maxn][maxn];
int main()
{
while (cin >> n >> m && n) {
memset(dp, 0, sizeof(dp));
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
cin >> a[i][j];
a[i][j] += a[i][j - 1];
}
}
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
cin >> b[i][j];
b[i][j] += b[i - 1][j];
}
}
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
//
int row = a[i][j] + dp[i - 1][j];
int col = b[i][j] + dp[i][j - 1];
dp[i][j] = max(row, col);
}
}
cout << dp[n][m] << endl;
}
return 0;
}
UVA1366
最新推荐文章于 2024-09-02 20:21:30 发布