vlatkovski

Kuglanje

Sep 30th, 2017
244
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
C++ 0.71 KB | None | 0 0
  1. #include <bits/stdc++.h>
  2. using namespace std;
  3.  
  4. int main() {
  5.     int n; cin >> n;
  6.     vector<vector<int>> triag;
  7.     for (int i = 1; i <= n; ++i) {
  8.         vector<int> v;
  9.         for (int j = 1; j <= i; ++j) {
  10.             int x; cin >> x;
  11.             v.push_back(x);
  12.         }
  13.         triag.push_back(v);
  14.     }
  15.  
  16.     if (n == 2) {
  17.         cout << triag[0][0] + max(triag[1][0], triag[1][0]) << endl;
  18.     } else if (n == 1) {
  19.         cout << triag[0][0] << endl;
  20.     }
  21.     else {
  22.         for (int i = n - 2; i >= 0; --i) {
  23.             for (int j = 0; j <= i; j++) {
  24.                 triag[i][j] += max(triag[i+1][j], triag[i+1][j+1]);
  25.             }
  26.         }
  27.         cout << triag[0][0] << endl;
  28.     }
  29. }
Advertisement
Add Comment
Please, Sign In to add comment