# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
919160 | TIN | Baloni (COCI15_baloni) | C++17 | 64 ms | 13652 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 <bits/stdc++.h>
using namespace std;
#define FNAME "test"
const int N = 1e6 + 5;
int n;
int h[N];
int pre[N];
int p[N];
bool b[N];
int ST[4 * N];
void Task() {
ios_base::sync_with_stdio(false);
cin.tie(0); cout.tie(0);
cout << fixed << setprecision(9);
if (fopen(FNAME".inp","r")) {
freopen(FNAME".inp","r",stdin);
freopen(FNAME".out","w",stdout);
}
}
void Solve() {
//Your Code
cin >> n;
for (int i = 1; i <= n; i++) cin >> h[i];
memset(p, 0, sizeof(p));
memset(pre, 0, sizeof(pre));
memset(b, true, sizeof(b));
for (int i = 1; i <= n; i++) {
if (b[pre[h[i] + 1]]) {
p[i] = pre[h[i] + 1];
b[pre[h[i] + 1]] = false;
}
pre[h[i]] = i;
}
int res = 0;
for (int i = 1; i <= n; i++) res += (p[i] == 0);
cout << res << '\n';
}
int main() {
Task();
Solve();
cerr << "\nTime run: " << 1000*clock()/CLOCKS_PER_SEC << "ms";
return 37^37;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |