oj.uz

답안 #154576

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
154576 2019-09-22T19:21:38 Z dolphingarlic 지구 온난화 (NOI13_gw) C++14
6 / 40
 35 ms 4272 KB 
#include <bits/stdc++.h>
#define FOR(i, x, y) for (int i = x; i < y; i++)
typedef long long ll;
using namespace std;

int k[100001];
priority_queue<pair<int, int>> pq;

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int n;
    cin >> n;
    FOR(i, 0, n) {
        cin >> k[i];
        pq.push({k[i], i});
    }

    int ans = 0, curr = 0;
    while (pq.size()) {
        int h, indx;
        tie(h, indx) = pq.top();
        pq.pop();

        if ((indx == 0 || h >= k[indx - 1]) && (indx == n - 1 || h > k[indx + 1])) curr++;
        else if ((indx != 0 && h < k[indx - 1]) && (indx != n - 1 && h < k[indx + 1])) curr--;
        ans = max(ans, curr);
    }

    cout << ans;
    return 0;
}

Subtask #1
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 508 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 3 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct

Subtask #2
0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 30 ms 2000 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 35 ms 2676 KB Output is correct
2 Correct 27 ms 2420 KB Output is correct
3 Incorrect 35 ms 2544 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 23 ms 4272 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #5
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 22 ms 4180 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -