Submission #677854

#	Time	Username	Problem	Language	Result	Execution time	Memory
677854		Mher	Money (IZhO17_money)	C++14	0 / 100	1 ms	212 KiB

money

#define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
#include <queue>

using namespace std;

const int N = 1000003, mod = 1e9 + 7;

int n;
int a[N];

void solve()
{
    cin >> n;
    for (int i = 1; i <= n; i++)
        cin >> a[i];
    int ans = 0;
    multiset<int> st;
    multiset<int>::iterator p = st.insert(0), c;
    for (int i = 1; i <= n; i++)
    {
        c = st.insert(a[i]);
        if (*p != a[i])
        {
            if (st.count(a[i]) > 1)
                c = st.lower_bound(a[i]);
            if (++p != c)
            {
                ans++;
                p = c;
            }
            continue;
        }
        p++;
    }
    cout << ans + 1 << endl;
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int t = 1;
    //cin >> t;
    while (t--)
        solve();
    return 0;
}

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