Submission #1286541

#TimeUsernameProblemLanguageResultExecution timeMemory
1286541arman.khachatryanMoney (IZhO17_money)C++20
45 / 100
1586 ms4464 KiB
#include <bits/stdc++.h> using namespace std; #define ll long long const long long N=1e6+5; ll a[N]; int main() { ll n; cin>>n; for(ll i=1; i<=n; i++){ cin>>a[i]; } vector<ll> v; ll cnt=0; v.push_back(0); v.push_back(N+1); for(ll i=1; i<=n; i++){ ll l=0, r=v.size()-1; while(l<r){ ll mid=(l+r)/2; if(v[mid]>a[i]){ r=mid; }else{ l=mid+1; } } v.push_back(a[i]); while(i+1<=n && a[i+1]>=a[i] && a[i+1]<=v[r]){ i++; v.push_back(a[i]); } sort(v.begin(), v.end()); cnt++; } cout<<cnt; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...