Hackerrank/Candies.cpp at master · vasiljevski/Hackerrank · GitHub

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
57
58
59
60
61
62
63
64
65
66
67
68
#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>

using namespace std;

int main() {
    /* Enter your code here. Read input from STDIN. Print output to STDOUT */
    int n;
    cin >> n;

    vector<int> temp(n);

    for(int i = 0; i < n; i++){
        cin >> temp[i];
    }

    vector<int> sol(n, 1);

    long long int ans = 0;

    for(int i = 0; i < n; i++){
        if(i == 0){
            if(i+1 < n && temp[i] > temp[i+1]){
                sol[i] = max(sol[i], sol[i+1] + 1);
            }
        }
        else if(i != n-1){
            if(temp[i] > temp[i+1]){
                sol[i] = max(sol[i], sol[i+1] + 1);
            }
            if(temp[i] > temp[i-1]){
                sol[i] = max(sol[i], sol[i-1] + 1);
            }
        }
    }

    for(int i = n-1; i >= 0; i--){
        if(i == n-1){
            if(i-1 >= 0 && temp[i] > temp[i-1]){
                sol[i] = max(sol[i], sol[i-1] + 1);
            }
        }
        else if(i != 0){
            if(temp[i] > temp[i+1]){
                sol[i] = max(sol[i], sol[i+1] + 1);
            }
            if(temp[i] > temp[i-1]){
                sol[i] = max(sol[i], sol[i-1] + 1);
            }
        }
        else{
            if(temp[i] > temp[i+1]){
                sol[i] = max(sol[i], sol[i+1] + 1);
            }
        }
    }

    for(int i = 0; i < n; i++){
        ans = ans + sol[i];
    }

    cout << ans << endl;

    return 0;
}