Submission #1315224

#	Time	Username	Problem	Language	Result	Execution time	Memory
1315224		trainingdnns	Global Warming (NOI13_gw)	C++17	40 / 40	375 ms	12068 KiB

gw

#include <bits/stdc++.h>
using namespace std;

int main() {
    int n; cin >> n;
    vector<pair<int, int>> a(n);
    for (int i = 0; i < n; ++i) {
        cin >> a[i].first; 
        a[i].second = i;         
    }
    sort(a.begin(), a.end(),
         [](const auto &x, const auto &y) { return x.first > y.first;});
    vector<int> seen(n, 0);
    int curILC = 0;        
    int best = 0;        
    for (int i = 0; i < n; ) {
        int j = i;
        while (j < n && a[j].first == a[i].first) {
            int pos = a[j].second;
            bool left  = (pos > 0 && seen[pos - 1]);
            bool right = (pos + 1 < n && seen[pos + 1]);
            if (!left && !right) ++curILC;
            else if (left && right) --curILC;
            seen[pos] = 1;
            ++j;
        }
        best = max(best, curILC);
        i = j;
    }
    cout << best << endl;
}

• Subtask 1: 6 / 6
• Subtask 2: 6 / 6
• Subtask 3: 7 / 7
• Subtask 4: 10 / 10
• Subtask 5: 11 / 11