Submission #338928

#TimeUsernameProblemLanguageResultExecution timeMemory
338928kkkMoney (IZhO17_money)C++14
45 / 100
1589 ms57492 KiB
#include<iostream> #include<set> using namespace std; long long m[10000004]; set <long long> s; int main() { long long n,i,pr=1e10,br=0; cin>>n; for(i=0;i<n;i++)cin>>m[i]; s.insert(pr); for(i=0;i<n;i++) { pr=*s.upper_bound(m[i]); s.insert(m[i]); while(i<n-1 && m[i]<=m[i+1] && m[i+1]<=pr) {s.insert(m[i+1]);i++;} br++; } cout<<br<<endl; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...