Submission #706591

#	Time	Username	Problem	Language	Result	Execution time	Memory
706591		Shreyan_Paliwal	Money (IZhO17_money)	C++17	0 / 100	0 ms	340 KiB

money

#include <bits/stdc++.h>
using namespace std;

const int maxn = 1e6;

int n;
int a[maxn + 5];

int bit[maxn + 1];
void upd(int k, int v) {
    for ( ; k <= maxn; k += (k & -k))
        bit[k] += v;
}
int qry(int k) {
    int ret = 0;
    for (; k; k -= (k & -k))
        ret += bit[k];
    return ret;
}

int main() {
    // freopen("main.in", "r", stdin);

    cin >> n;
    for (int i = 0; i < n; i++)
        cin >> a[i];


    // figure out nondecreasing sequences
    int l = 0;
    int ans = 0;
    for (int i = 0; i < n; i++) {
        if (i == n - 1 || a[i + 1] < a[i]) {
            // [l, i]
            int L = l;
            for (int j = l + 1; j <= i; j++) {
                // cout << l << ' ' << i << ' ' << L << ' ' << j << endl;
                // cout << qry(a[j]-1) << ' ' << qry(a[L]-1) << endl;
                
                if (a[j] > a[L] && qry(a[j] - 1) - qry(a[L])) {
                    ans++;
                    L = j + 1; j++;
                }
            }
            
            for (int k = L; k <= i; k++) {
                upd(a[k], 1);
            }

            ans++;
            l = i + 1;
        }
    }

    cout << ans << endl;

    return 0;
}

• Subtask 1: 0 / 9
• Subtask 2: 0 / 16
• Subtask 3: 0 / 20
• Subtask 4: 0 / 55