# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
950006 | Pragmatism | Money (IZhO17_money) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
//Bismillahir-Rahmanir-Rahim
#include <bits/stdc++.h>
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("O1,O2,O3,Ofast,unroll-loops")
#pragma GCC target("sse,sse2,sse3,sse4,sse4.1,sse4.2,popcnt,avx,avx2")
#define pb push_back
#define pii pair <int, int>
#define pll pair <long long, long long>
#define pld pair <long double, long double>
#define ll long long
#define ld long double
#define x first
#define y second
#define all(v) v.begin(),v.end()
#define sz(s) (int)s.size()
#define skip continue
#define bpop(x) (ll)__builtin_popcountll(x)
using namespace std;
const int N = 1e6 + 7;
const int M = 1e5 + 7;
const int maxA = 1e5 + 7;
const int inf = 1e9 + 7;
const ll INF = 2e18 + 7;
const int MOD = 998244353;
const ld eps = 1e-9;
pii dir[] = {{0, 1}, {1, 0}, {0, -1}, {-1, 0}};
//mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
//clock_t start = clock();
//#define int long long
int n, a[N];
bool used[N];
int get(int len) {
for (int i = 1;i <= n;i++)used[a[i]] = 0;
for (int i = 1;i <= len;i++)used[a[i]] = 1;
int res = 1;
//cout << len << ":\n";
for (int i = len + 1;i <= n;) {
int pos = i, last = a[i];
used[a[i]]++;
while (pos < n) {
bool ok = (a[pos + 1] >= last);
for (int x = last + 1;x < a[pos + 1];x++)ok &= (!used[x]);
if (!ok)break;
pos++, last = a[pos], used[a[pos]] = 1;
}
//cout << i << ':' << pos << '\n';
i = pos + 1, res++;
}
return res;
}
void solve() {
cin >> n;
for (int i = 1;i <= n;i++)cin >> a[i];
int ans = n;
for (int i = 1;i <= n;i++) {
if (a[i] < a[i - 1])break;
ans = min(ans, get(i));
}
cout << ans;
}
signed main() {
//srand(time(NULL));
ios_base::sync_with_stdio(0);
cin.tie(0);
//freopen("subsequence.in", "r", stdin);
//freopen("subsequence.out", "w", stdout);
int test = 1;
//cin >> test;
for (int t = 1;t <= test;t++) {
//cout << "Case " << t << ": ";
solve();
}
return 0;
}