제출 #535550

#제출 시각아이디문제언어결과실행 시간메모리
535550i_am_noobMoney (IZhO17_money)C++17
100 / 100
1058 ms61940 KiB
#include <bits/stdc++.h> using namespace std; #pragma GCC optimize("Ofast,unroll-loops") #define ll long long #define int ll #define ull unsigned ll #define ld long double #define rep(a) rep1(i,a) #define rep1(i,a) rep2(i,0,a) #define rep2(i,b,a) for(int i=(b); i<((int)(a)); i++) #define rep3(i,b,a) for(int i=(b); i>=((int)(a)); i--) #define chkmin(a,b) (a=min(a,b)) #define chkmax(a,b) (a=max(a,b)) #define all(a) a.begin(),a.end() #define pii pair<int,int> #define pb push_back //#define inf 1010000000 #define inf 4000000000000000000 #define eps 1e-9 #define sz(a) ((int)a.size()) #define pow2(x) (1ll<<(x)) #define ceiling(a,b) (((a)+(b)-1)/(b)) #define print0(a) cout << (a) << ' ' #define ykh mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()) #ifdef i_am_noob #define bug(...) cerr << "#" << __LINE__ << ' ' << #__VA_ARGS__ << "- ", _do(__VA_ARGS__) template<typename T> void _do(T && x) {cerr << x << endl;} template<typename T, typename ...S> void _do(T && x, S&&...y) {cerr << x << ", "; _do(y...);} #else #define bug(...) 777771449 #endif const int mod=1000000007; const int maxn=1000005,maxm=18,maxk=7777714; //i_am_noob int n,a[maxn],res; void orzck(){ cin >> n; rep(n) cin >> a[i]; set<int> st; st.insert(inf); int nxt=inf; rep(n){ if(i&&a[i]==a[i-1]) continue; if(i==0||a[i]<a[i-1]||*st.lower_bound(a[i])!=nxt) res++,nxt=*st.upper_bound(a[i]); st.insert(a[i]); } cout << res << "\n"; } signed main(){ ios_base::sync_with_stdio(0),cin.tie(0); orzck(); 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...