254302026-02-20 02:44:56999Kártyajátékcpp17Accepted 30/30108ms5940 KiB
// Source: https://usaco.guide/general/io

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

signed main() {
    int randomassuselessinfo,n;cin>>randomassuselessinfo>>n;
    vector<int> v(n),ans(n,-1),mx(n);
    for(int i = 0;i<n;i++){
        cin>>v[i];
        mx[i]=v[i];
        if(i>0)mx[i]=max(mx[i],mx[i-1]);
    }
    for(int i = 0;i<n;i++){
        int lo=-1,hi=i,mi=0;
        while(lo<hi-1){
            mi=(lo+hi)/2;
            if(mx[mi]>v[i])hi=mi;
            else lo=mi;
        }
        if(hi!=i)ans[i]=hi;
    }
    map<int,int> m;
    for(int i = 0;i<n;i++){
        if(ans[i]!=-1)m[ans[i]]++;
    }
    int cnt=0;
    for(auto [a,b]:m)cnt++;
    cout<<cnt<<endl;
}
SubtaskSumTestVerdictTimeMemory
base30/30
1Accepted0/01ms500 KiB
2Accepted0/0108ms5684 KiB
3Accepted1/11ms508 KiB
4Accepted1/11ms316 KiB
5Accepted1/11ms316 KiB
6Accepted2/21ms420 KiB
7Accepted2/21ms316 KiB
8Accepted2/21ms352 KiB
9Accepted1/141ms2100 KiB
10Accepted2/264ms4140 KiB
11Accepted3/357ms4044 KiB
12Accepted3/361ms4144 KiB
13Accepted1/1104ms4156 KiB
14Accepted2/2108ms5816 KiB
15Accepted3/3100ms5940 KiB
16Accepted3/3107ms5940 KiB
17Accepted3/3104ms5380 KiB