oj.uz

Submission #677821

# Submission time Handle Problem Language Result Execution time Memory
677821 2023-01-04T12:11:48 Z Tigryonochekk Money (IZhO17_money) C++17
0 / 100
 0 ms 212 KB 
#include <iostream>
#include <algorithm>
#include <cmath>
#include <map>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define ll long long
#define ld long double
#define pii pair<int, int>

const int N = 1e6 + 2;

int n;
int a[N];

int main() {
    cin >> n;
    for (int i = 1; i <= n; i++) {
        cin >> a[i];
    }
    int ans = n;
    int cl = 1;
    for (int i = 1; i < n; i++) {
        if (a[i] > a[i + 1]) {
            ans -= i - cl;
            cl = i + 1;
            continue;
        }
        int x = upper_bound(a, a + cl, a[cl]) - a;
        int y = lower_bound(a, a + cl, a[i + 1]) - a;
        if(x != y) {
            ans -= (i - cl);
            cl = i + 1;
        }
    }
    ans -= (n - cl);
    cout << ans << endl;
    return 0;
}
/*
6
3 6 4 5 1 2

6
1 2 2 3 4 5

4
4 1 4 5
*/

Subtask #1
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Incorrect 0 ms 212 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Incorrect 0 ms 212 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Incorrect 0 ms 212 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 55.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Incorrect 0 ms 212 KB Output isn't correct
3 Halted 0 ms 0 KB -