#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <iomanip>
#include <algorithm>
#include <memory>
#include <functional>
#include <numeric>
#include <sstream>
#include <queue>
#include <deque>
#include <list>
#include <vector>
#include <stack>
#include <set>
#include <unordered_set>
#include <map>
#include <unordered_map>
#include <bitset>
#include <tuple>
#include <string>
#include <cstring>
#include <cmath>
#include <cstdio>
#include <cassert>
#include <climits>
#include <ctime>
using namespace std;
#define rep(i, x, y) for(int i = x; i <= y; ++i)
#define mp make_pair
#define add push_back
#define sz(x) (int)(x).size()
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define mem(a,b) memset(a, b, sizeof(a))
#pragma warning(disable:4996)
#pragma comment(linker, "/STACK:20000007")
#pragma GCC optimize("unroll-loops")
typedef long long ll;
typedef unsigned long long ull;
typedef double db;
typedef long double ld;
typedef pair <int, int> pii;
typedef vector <int> lnum;
const int N = (int)1e6 + 100;
const int maxn = (int)1e3 + 100;
const int base = (int)1e9;
const int mod = (int)1e9 + 7;
const int inf = INT_MAX;
const long long ll_inf = LLONG_MAX;
const long double PI = acos((long double)-1.0);
const long double eps = 1e-8;
int T[4 * N];
void update(int v, int tl, int tr, int pos, int val) {
if (tl == tr) {
T[v] = val;
return;
}
int tm = (tl + tr) >> 1;
if (pos <= tm) update(2 * v + 1, tl, tm, pos, val);
else update(2 * v + 2, tm + 1, tr, pos, val);
T[v] = T[2 * v + 1 ] + T[2 * v + 2];
}
int query(int v, int tl, int tr, int l, int r) {
if (l > r) return 0;
if (tl == l && tr == r) return T[v];
int tm = (tl + tr) >> 1;
return query(2 * v + 1, tl, tm, l, min(r, tm)) +
query(2 * v + 2, tm + 1, tr, max(l, tm + 1), r);
}
void solve() {
int n, ans = 0; cin >> n;
vector <int> V(n);
for (int i = 0; i < n; ++i) {
cin >> V[i];
}
for (int i = 0; i < n;) {
++ans;
int j = i;
for (; j + 1 < n && V[j] <= V[j + 1] && !query(0, 0, N - 1, V[j], V[j + 1] - 1);) ++j;
for (; i <= j && i < n; ++i) {
update(0, 0, N - 1, V[i], 1);
}
}
cout << ans << endl;
}
/*
6
3 6 4 5 1 2
*/
int main() {
//ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
//#define Freopen
#ifdef Freopen
#ifndef _MSC_VER
#define TASK ""
freopen(TASK".in", "r", stdin);
freopen(TASK".out", "w", stdout);
#endif
#endif
int T = 1;
//scanf("%d", &T);
for (; T; --T) solve();
#ifdef DEBUG
cerr << double(1.0 * clock() / CLOCKS_PER_SEC) << '\n';
#endif
return 0;
}
Compilation message
money.cpp:36:0: warning: ignoring #pragma warning [-Wunknown-pragmas]
#pragma warning(disable:4996)
money.cpp:37:0: warning: ignoring #pragma comment [-Wunknown-pragmas]
#pragma comment(linker, "/STACK:20000007")
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
376 KB |
Output is correct |
| 2 |
Correct |
2 ms |
548 KB |
Output is correct |
| 3 |
Correct |
2 ms |
548 KB |
Output is correct |
| 4 |
Incorrect |
2 ms |
548 KB |
Output isn't correct |
| 5 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
376 KB |
Output is correct |
| 2 |
Correct |
2 ms |
548 KB |
Output is correct |
| 3 |
Correct |
2 ms |
548 KB |
Output is correct |
| 4 |
Incorrect |
2 ms |
548 KB |
Output isn't correct |
| 5 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
376 KB |
Output is correct |
| 2 |
Correct |
2 ms |
548 KB |
Output is correct |
| 3 |
Correct |
2 ms |
548 KB |
Output is correct |
| 4 |
Incorrect |
2 ms |
548 KB |
Output isn't correct |
| 5 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
376 KB |
Output is correct |
| 2 |
Correct |
2 ms |
548 KB |
Output is correct |
| 3 |
Correct |
2 ms |
548 KB |
Output is correct |
| 4 |
Incorrect |
2 ms |
548 KB |
Output isn't correct |
| 5 |
Halted |
0 ms |
0 KB |
- |
