제출 #519780

#제출 시각아이디문제언어결과실행 시간메모리
519780Dasha_GnedkoMoney (IZhO17_money)C++17
100 / 100
165 ms25308 KiB
#include <bits/stdc++.h> //#include <ext/pb_ds/detail/standard_policies.hpp> //#include <ext/pb_ds/assoc_container.hpp> //#include <ext/pb_ds/tree_policy.hpp> //#pragma GCC optimize("Ofast") //#pragma GCC target("avx2") //#pragma GCC target("sse,sse2,sse3,ssse3,sse4") using namespace std; //using namespace __gnu_pbds; //template <typename T> using ordered_set = tree <T, null_type, less < T >, rb_tree_tag, tree_order_statistics_node_update>; mt19937 gen(time(0)); #define ll long long #define ld long double #define pb push_back #define F first #define S second #define TIME clock() * 1.0 / CLOCKS_PER_SEC #define sz(a) int32_t(a.size()) #define endl '\n' //#define int long long const int N = 1e6 + 100; const int M = 31; const int mod = 1e9 + 7; const int inf = 1e9 + 7; int a[N], nxt[N], cnt[N], cl[N]; int get(int v) { if (v >= N - 1) return N - 1; if (cnt[v]) return v; return nxt[v] = get(nxt[v]); } int32_t main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); #ifdef LOCAL freopen("input.txt", "r", stdin); freopen("output.txt", "w", stdout); #else // freopen("input.txt", "r", stdin); // freopen("output.txt", "w", stdout); #endif // LOCAL int n; cin >> n; for(int i = 0; i < n; i++) { cin >> a[i]; cnt[a[i]]++; } for(int i = 0; i < N - 1; i++) nxt[i] = i + 1; for(int i = n - 1; i >= 0; i--) { cnt[a[i]]--; cl[i] = get(a[i] + 1); } int ans = 0; for(int i = 0; i < n; ) { ans++; int j = i + 1; int x = cl[i]; while (j < n && a[j - 1] <= a[j] && a[j] <= x) j++; i = j; } cout << ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...