# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
553185 | Tien_Noob | Money (IZhO17_money) | C++17 | 988 ms | 61948 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.
//Make CSP great again
//Vengeance
#include <bits/stdc++.h>
#define TASK "TESTCODE"
#define Log2(x) 31 - __builtin_clz(x)
using namespace std;
const int N = 1e6;
int dp[N + 1], n, p = - 1, a[N + 1];
queue<int> Q;
set<int> Set;
void read()
{
cin >> n;
a[0] = 1e9;
for (int i = 1; i <= n; ++ i)
{
cin >> a[i];
if (a[i] < a[i - 1] || a[i] > p)
{
while(!Q.empty())
{
Set.insert(Q.front());
Q.pop();
}
dp[i] = dp[i - 1] + 1;
auto it = Set.upper_bound(a[i]);
p = (it == Set.end() ? N + 1 : *it);
}
else
{
dp[i] = dp[i - 1];
}
Q.push(a[i]);
//cerr << p << '\n';
}
cout << dp[n];
}
void solve()
{
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
if (fopen(TASK".INP", "r"))
{
freopen(TASK".INP", "r", stdin);
//freopen(TASK".OUT", "w", stdout);
}
int t = 1;
bool typetest = false;
if (typetest)
{
cin >> t;
}
for (int __ = 1; __ <= t; ++ __)
{
//cout << "Case " << __ << ": ";
read();
solve();
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |