數塔
Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 31867 Accepted Submission(s): 19036
有如下所示的數塔,要求從頂層走到底層,若每一步只能走到相鄰的結點,則經過的結點的數字之和最大是多少?
已經告訴你了,這是個DP的題目,你能AC嗎?
好久沒做動態規劃了,水一發!
從下往上算
#include <iostream>
#include <cstdio>
#include <cmath>
using namespace std;
int max(const int &a, const int &b)
{
return (a > b)?a:b;
}
int main()
{
int T, n, data[105][105];
scanf("%d", &T);
while (T--)
{
int dp[105] = {0};
scanf("%d", &n);
for (int i = 0; i < n; i++)
{
for (int j = 0; j <= i; j++)
{
scanf("%d", &data[i][j]);
}
}
for (int i = n - 1; i >= 0; i--)
{
for (int j = 0; j <= i; j++)
{
dp[j] = max(dp[j], dp[j + 1]) + data[i][j];
}
}
printf("%d\n", dp[0]);
}
return 0;
}