解题思路:
注意事项:
参考代码:
#include <iostream> #include <cstdio> using namespace std; int arr[30][30]; int main() { int n; scanf("%d", &n); for (int i = 1; i <= n; ++i) { for (int j = 1; j <= i; ++j) { scanf("%d", &arr[i][j]); } } int x, y; scanf("%d%d", &x, &y); for (int i = 2; i <= x; ++i) { for (int j = 1; j <= i; ++j) { arr[i][j] += max(arr[i-1][j], arr[i-1][j-1]); } } for (int i = n-1; i >= x; --i) { for (int j = 1; j <= i; ++j) { arr[i][j] += max(arr[i+1][j], arr[i+1][j+1]); } } printf("%d", arr[x][y]); return 0; }
0.0分
1 人评分