#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pii> vii;
typedef vector<vi> vvi;
typedef vector<vll> vvll;
typedef vector<vii> vvii;
#define fastIO ios::sync_with_stdio(false), cin.tie(NULL)
#define forw(i, l, r) for( int i = (l) ; i < (r) ; i++ )
#define forb(i, r, l) for( int i = (r) ; i >= (l) ; i-- )
#define log2i(x) (64 - __builtin_clzll(1ll * (x)) - 1)
#define numBit(x) (__builtin_popcountll(1ll * (x)))
#define getBit(x, i) ((x) >> (i) & 1)
#define Pi acos(-1.0l)
#define sz(x) int(x.size())
#define mt make_tuple
#define mp make_pair
#define fi first
#define se second
#define pb push_back
#define pf push_front
#define pob pop_back
#define pof pop_front
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define debug(x) cerr << #x << " = " << x << '\n';
int n, ans = 0;
stack<int> s;
int main() {
fastIO;
#ifndef ONLINE_JUDGE
//freopen("test.inp", "r", stdin);
//freopen("test.out", "w", stdout);
#endif
cin >> n;
forw(i, 0, n) {
int x; cin >> x;
while(sz(s) && s.top() >= x) {
if(s.top() > x) ans++;
s.pop();
}
s.push(x);
}
cout << ans + sz(s);
return 0;
}
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
204 KB |
Output is correct |
| 2 |
Incorrect |
1 ms |
204 KB |
Output isn't correct |
| 3 |
Incorrect |
1 ms |
204 KB |
Output isn't correct |
| 4 |
Incorrect |
5 ms |
332 KB |
Output isn't correct |
| 5 |
Incorrect |
7 ms |
460 KB |
Output isn't correct |
| 6 |
Correct |
11 ms |
716 KB |
Output is correct |
| 7 |
Incorrect |
12 ms |
564 KB |
Output isn't correct |
