# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
51335 | Nicksechko | Money (IZhO17_money) | C++11 | 1541 ms | 51600 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.
#include <iostream>
#include <fstream>
#include <set>
#include <map>
#include <string>
#include <vector>
#include <bitset>
#include <algorithm>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <cassert>
#include <queue>
#define mp make_pair
#define pb push_back
typedef long long ll;
typedef long double ld;
using namespace std;
const int MX = 1001000;
int n;
int a[MX];
set<int> ss;
int main() {
// freopen("money.in", "r", stdin);
// freopen("money.out", "w", stdout);
scanf("%d", &n);
for (int i = 0; i < n; ++i)
scanf("%d", a + i);
int cnt = 0;
int now = 0;
while (now < n) {
++cnt;
auto it = ss.upper_bound(a[now]);
int rb = 1e7;
if (it != ss.end())
rb = *it;
int lb = a[now];
while (now < n && a[now] >= lb && a[now] <= rb)
ss.insert(a[now]), lb = a[now], ++now;
}
cout << cnt << "\n";
return 0;
}
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... |