Submission #798242

#	Time	Username	Problem	Language	Result	Execution time	Memory
798242		BidoTeima	Money (IZhO17_money)	C++17	0 / 100	1 ms	212 KiB

money

#include <bits/stdc++.h> 
typedef long long ll;
using namespace std;  
int main() {     
    int n;
    cin>>n;
    int a[n];
    set<int>st;
    map<int,int>freq{};
    for(int i = 0; i < n; i++)cin>>a[i],st.insert(a[i]),++freq[a[i]];  
    reverse(a,a+n);
    //pos(a[i])==pos(a[i-1])-1
    int ans = 1, p = 0;
    for(int i = 1; i < n; i++){
        if(a[i]==a[i-1]||st.find(a[i])==prev(st.find(a[i-1]))){
            continue;
        }else{ 
            for(int j = p; j < i; j++){
                --freq[a[j]];
                if(freq[a[j]]==0){
                    st.erase(a[j]);
                }
            }
            ++ans;
            p = i;
        }
    }
    cout<<ans;
    return 0;
}

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