cpp/B_Histogram_Ugliness.cpp at main · igoswamik/cpp · 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
69
70
71
72
73
74
75
76
77
78
79
80
81
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
void solve(ll n)
{
    vector<ll> v;
    for (int i = 0; i < n; i++)
    {
        ll x;
        cin >> x;
        v.push_back(x);
    }
    if (n == 1)
    {
        cout << v[0] << endl;
        return;
    }

    ll op = 0;
    for (int i = 0; i < n; i++)
    {
        if (i == 0)
        {
            if (v[i] > v[i + 1])
            {
                op += v[i] - v[i + 1];
                v[i] = v[i + 1];
            }
        }
        else if (i == n - 1)
        {
            if (v[i] > v[i - 1])
            {
                op += v[i] - v[i - 1];
                v[i] = v[i - 1];
            }
        }
        else
        {
            if (v[i] > v[i - 1] && v[i] > v[i + 1])
            {
                op += v[i] - max(v[i + 1], v[i - 1]);
                v[i] = max(v[i + 1], v[i - 1]);
            }
        }
    }

    ll count = 0;
    for (int i = 0; i < n; i++)
    {
        if (i == 0)
            count += v[i];
        else if (i == n - 1)
            count += v[i];
        else
        {
            if (v[i] > v[i - 1])
                count += v[i] - v[i - 1];
            if (v[i] > v[i + 1])
                count += v[i] - v[i + 1];
        }
    }
    ll ans = count + op;
    cout << ans << endl;
}

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    ll t;
    cin >> t;
    while (t--)
    {
        ll n;
        cin >> n;
        solve(n);
    }
    return 0;
}