Submission #377048

#	Time	Username	Problem	Language	Result	Execution time	Memory
377048		ijxjdjd	Money (IZhO17_money)	C++14	0 / 100	1 ms	364 KiB

money

#include <bits/stdc++.h>
#define FR(i, N) for (int i = 0; i < int(N); i++)
#define all(x) begin(x), end(x)

using namespace std;

using ll = long long;

int main() {
	cin.tie(0);
	cin.sync_with_stdio(0);
	int N;
	multiset<int> left;
	cin >> N;
	vector<int> arr(N);
	FR(i, N) {
	    cin >> arr[i];
        left.insert(arr[i]);
    }
    int lst = arr[N-1];
    left.erase(left.find(arr[N-1]));
    int ans = 1;
    for (int i = N-2; i >= 0; i--) {
        auto it = left.upper_bound(lst);
        if (it != left.begin() && *(prev(it)) == arr[i]) {
        }
        else {
            lst = arr[i];
            ans++;
        }
        left.erase(left.find(arr[i]));
    }
    cout << ans << '\n';
	return 0;
}

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