oj.uz

답안 #85025

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
85025 2018-11-18T06:51:42 Z muradeyn Money (IZhO17_money) C++14
0 / 100
 3 ms 500 KB 
/* Murad Eynizade */

#include <bits/stdc++.h>
#define intt long long
#define FAST_READ ios_base::sync_with_stdio(0);cin.tie(0);
#define SIZE 1000001
#define INF INT_MAX
#define F first
#define S second
#define in(a) scanf("%d",&a);
#define outn(a) printf("%d\n",&a);
#define outs(a) printf("%d ",&a);
#define MOD 1000000007

using namespace std;

int n , a[SIZE] , co = 1 , tree[4 * SIZE];

void update(int v,int l,int r,int in) {
    if (l == r) {
        tree[v] = 1;
        return;
    }
    int m = (l + r) >> 1;
    if (in <= m)update(v << 1,l,m,in);
    else update(v << 1 | 1,m + 1,r,in);
    tree[v] = tree[v << 1] + tree[v << 1 | 1];
}

int getans(int v,int l,int r,int le,int ri) {
    if (l > ri || r < le)return 0;
    if (l >= le && r <= ri)return tree[v];
    int m = (l + r) >> 1;
    return getans(v << 1,l,m,le,ri) + getans(v << 1 | 1,m + 1,r,le,ri);
}

int main()
{
    FAST_READ;
    cin>>n;
    for (int i = 1;i<=n;i++)cin>>a[i];
    update(1,1,SIZE - 1,a[1]);
    int f = a[1];
    for (int i = 2;i<=n;i++) {
        update(1,1,SIZE - 1,a[i]);
        if (a[i] < a[i - 1]) {
            f = a[i];
            co++;
        }
        else {
            if (getans(1,1,SIZE - 1,f,a[i]) - getans(1,1,SIZE - 1,f,f) - getans(1,1,SIZE - 1,a[i],a[i])) {
                f = a[i];
                co++;
            }
        }
    }
    cout<<co<<endl;
    return 0;
}

Subtask #1
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 376 KB Output is correct
2 Incorrect 2 ms 500 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 376 KB Output is correct
2 Incorrect 2 ms 500 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 376 KB Output is correct
2 Incorrect 2 ms 500 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 55.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 376 KB Output is correct
2 Incorrect 2 ms 500 KB Output isn't correct
3 Halted 0 ms 0 KB -