Year_1/Programming_2/coding_contest/scheletri.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
48
49
50
51
52
53
54
55
56

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

using namespace std;

int find_i(int index, vector<int> cms) {
    for(int i = index; i < cms.size(); ++i) {
        if(cms.at(i) != 0)
            return i;
    }
    
    return 0;
}

int find_j(int index, vector<int> cms) {
    for(int j = index; j < cms.size()-1; ++j) {
        if(cms.at(j+1) == 0)
            return j+1;
    }
    
    return cms.size();
}

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

    short N;
    for(int __c = 0; __c < 100; ++__c) {
        in >> N;
        vector<int> cms;
        int el;
        for(short i = 0; i < N; ++i) {
            in >> el;
            cms.push_back(el);
        }
        
        int counter{};
        int i{}, j{};
        while(count_if(begin(cms), end(cms), [](int num) { return num == 0; } ) != cms.size() ) {
            i = find_i(i, cms);
            j = find_j(i, cms);
            for(int ii = i; ii < j; ++ii) {
                --cms[ii];
            }
            ++counter;
        }
        out << counter << endl;
    }

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