數塔
Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 20786 Accepted Submission(s): 12486
有如下所示的數塔,要求從頂層走到底層,若每一步只能走到相鄰的結點,則經過的結點的數字之和最大是多少?
已經告訴你了,這是個DP的題目,你能AC嗎?
#include <iostream>
#include <string>
using namespace std;
const int MAXX = 105;
int tower[MAXX][MAXX];
int max(int x, int y){
if (x > y)return x;
return y;
}
void solve(int n){
for (int i = n - 1; i >= 0; --i){
for (int j = 0; j <= i; ++j){
tower[i][j] += max(tower[i + 1][j], tower[i + 1][j + 1]);
}
}
}
int main(){
//freopen("in.txt", "r", stdin);
int c, n;
cin >> c;
while (c--){
cin >> n;
memset(tower, 0, sizeof(tower));
for (int i = 0; i < n; ++i){
for (int j = 0; j < n; ++j){
if (i >= j)cin >> tower[i][j];
}
}
solve(n);
printf("%d\n",tower[0][0]);
}
}