Submission #1038316

#TimeUsernameProblemLanguageResultExecution timeMemory
1038316TrinhKhanhDungMoney (IZhO17_money)C++14
0 / 100
0 ms348 KiB
#include <bits/stdc++.h> #define ll long long #define fi first #define se second #define sz(x) (int)x.size() #define ALL(v) v.begin(),v.end() #define MASK(k) (1LL << (k)) #define BIT(x, i) (((x) >> (i)) & 1) #define oo (ll)1e18 #define INF (ll)1e9 #define MOD (ll)(1e9 + 7) using namespace std; template<class T1, class T2> bool maximize(T1 &a, T2 b){if(a < b){a = b; return true;} return false;} template<class T1, class T2> bool minimize(T1 &a, T2 b){if(a > b){a = b; return true;} return false;} template<class T1, class T2> void add(T1 &a, T2 b){a += b; if(a >= MOD) a -= MOD;} template<class T1, class T2> void sub(T1 &a, T2 b){a -= b; if(a < 0) a += MOD;} template<class T> void cps(T &v){sort(ALL(v)); v.resize(unique(ALL(v)) - v.begin());} const int MAX = 1e6 + 10; int N; int a[MAX]; void solve(){ cin >> N; for(int i=1; i<=N; i++){ cin >> a[i]; } set<int> st; st.insert((int)1e9); int ans = 0; int i = 1; while(i <= N){ int up = *st.upper_bound(a[i]); while(i < N && a[i + 1] >= a[i] && a[i + 1] <= up){ st.insert(a[i + 1]); i++; } ans++; i++; } cout << ans << '\n'; } signed main(){ ios_base::sync_with_stdio(0); cin.tie(0); // freopen("task.inp", "r", stdin); // freopen("task.out", "w", stdout); int t = 1; // cin >> t; while(t--){ solve(); } 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...