제출 #677802

#제출 시각아이디문제언어결과실행 시간메모리
677802TigryonochekkMoney (IZhO17_money)C++17
0 / 100
1 ms312 KiB
#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;
    for (int i = 1; i < n; i++) {
        if (a[i] > a[i + 1]) continue;
        bool f = true;
        for (int j = 1; j < i; j++) {
            if (a[j] > a[i] && a[j] < a[i + 1])
                f = false;
        }
        if (f)
            ans--;
    }
    cout << ans << endl;
    return 0;
}
/*
6
3 6 4 5 1 2
*/
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...