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;
const int mxN=1.5e5;
int n, l, a[mxN], b[mxN];
int update(int j, int y) {
a[j]=y;
for(int i=0; i<n; ++i)
b[i]=a[i];
sort(b,b+n);
int ans=1, l=0;
for(int i=0; i<n; ++i) {
if(b[i]-b[l]>l)
l=i, ++ans;
}
return ans;
}
void init(int N, int L, int* X) {
n=N, l=N;
for(int i=0; i<n; ++i)
a[i]=X[i];
}
| # | 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... |
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |