I_anno/Programmazione_2/coding_contest/gribaudo.cpp


1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47

#include<iostream>
#include<vector>
#include<fstream>

using namespace std;

int maxpath(vector<vector<int>>& v) {
    for(int i = v.size()-2; i >= 0; --i) {
        for(int j = 0; j <= i; ++j) {
            if(v[i+1][j] > v[i+1][j+1]) {
                v[i][j] += v[i+1][j];
            } else {
                v[i][j] += v[i+1][j+1];
            }
        }
    }

    return v[0][0];
}

int main() {
    ifstream in("input.txt");
    ofstream out("output.txt");

    for(int ts = 0; ts < 1; ++ts) {
        int N;
        in >> N;
        vector<vector<int>> triangle;

        for(int i = 0; i < N; ++i) {
            int e;
            triangle.push_back(vector<int>{});
            int j;
            for(j = 0; j <= i; ++j) {
                in >> e;
                triangle[i].push_back(e);
            }
            for(; j < N; ++j) 
                triangle[i].push_back(0);
        }
        out << maxpath(triangle) << endl;
    }

    in.close();
    out.close();
    return 0;
}