#include using namespace std; const int N = 110; int f[N][N]; int a[N][N]; int main() { int t; cin >> t; while (t--) { memset(f, 0, sizeof f); memset(a, 0, sizeof a); int n; cin >> n; for (int i = 1; i <= n; i++) { for (int j = 1; j > a[i][j]; f[i][j] = max(f[i - 1][j - 1], f[i - 1][j]) + a[i][j]; } } int res = -0x3f3f3f3f; for (int i = 1; i <= n; i++) res = max(res, f[n][i]); cout << res << endl; } }
解题思路:
注意事项:
参考代码:
0.0分
1 人评分