제출 #37180

#제출 시각아이디문제언어결과실행 시간메모리
37180Ulugbek_AbdimanabovMoney (IZhO17_money)C++14
45 / 100
1500 ms53380 KiB
#include <bits/stdc++.h> typedef long long ll; typedef long double ld; #define vi vector<ll> #define pii pair<int,int> #define pll pair<ll,ll> #define rep(i,a,n) for(ll i=a; i<n; i++) #define per(i,a,n) for(ll i=n-1; i>=a; i--) #define F first #define S second #define maxx(a,b) a=max(a,b) #define minn(a,b) a=min(a,b) #define db(x) cerr << #x << " = " << x << endl #define N 1111111 using namespace std; int a[N]; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); // freopen("money.in","r",stdin); //freopen("money.out","w",stdout); int n; cin>>n; rep(i,0,n)cin>>a[i]; set<int> s; int ans=0; s.insert(1e6+1); for(int i=0; i<n;) { int limit=*s.upper_bound(a[i]); int last=a[i]; while(i<n&&a[i]>=last&&a[i]<=limit)last=a[i],s.insert(a[i]),i++; ans++; } cout<<ans; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...