Submission #1147362

#	Time	Username	Problem	Language	Result	Execution time	Memory
1147362		njoop	지구 온난화 (NOI13_gw)	C++17	40 / 40	154 ms	12252 KiB

gw

#include <bits/stdc++.h>

using namespace std;

int n, x, ans, cnt;
vector<pair<int, int>> arr;
int is[1000010];

int main() {
    cin.tie(0)->sync_with_stdio(0);
    cin >> n;
    for(int i=1; i<=n; i++) {
        cin >> x;
        arr.push_back({x, i});
    }
    sort(arr.begin(), arr.end(), greater<pair<int, int>>());
    for(int i=0; i<n; i++) {
        int c = arr[i].second;
        if(is[c-1]+is[c+1] == 0) cnt++;
        if(is[c-1]+is[c+1] == 2) cnt--;
        is[c] = 1;
        if(i == n-1 || arr[i].first != arr[i+1].first) {
            ans = max(ans, cnt);
        }
    }
    cout << ans;
    return 0;
}

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