杭电OJ 2084 数塔 C++

Problem - 2084

#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;

int main() {
  int C;
  cin >> C;
  while (C--) {
    int N, temp;
    cin >> N;
    vector<vector<int>> nums(N, vector<int>(N, 0));
    for (int i = 0; i < N; i++) {
      for (int j = 0; j <= i; j++) {
        cin >> nums[i][j];
      }
    }
    for (int i = 1; i < N; i++) {
      for (int j = 0; j <= i; j++) {
        if (j == 0)
          nums[i][j] += nums[i - 1][j];
        else
          nums[i][j] += max(nums[i - 1][j - 1], nums[i - 1][j]);
      }
    }
    int ans = 0;
    for (auto n : nums[N - 1]) {
      ans = max(ans, n);
    }
    cout << ans << endl;
  }
}