#include<bits/stdc++.h>
using namespace std;
int n, lg;
int vals[150002], srt[150002];
void init(int N, int L, int X[])
{
n = N;
lg = L;
for(int i = 1; i <= N; ++i)
srt[i] = X[i-1], vals[i] = X[i-1];
sort(srt + 1, srt + n + 1);
srt[n+1] = 2100000000;
}
int binsearch(int val)
{
int st = 1;
int dr = n;
int ans = 0;
while(st <= dr)
{
int mid = (st + dr) / 2;
if(srt[mid] <= val)
ans = mid, st = mid + 1;
else
dr = mid - 1;
}
return ans;
}
int nw[150002];
int update(int xx, int y)
{
++xx;
if(n == 2)
{
vals[xx] = y;
if(abs(vals[1] - vals[2]) > lg)
return 2;
return 1;
}
int aa = 0;
for(int i = 1; i <= n; ++i)
if(srt[i] < y && srt[i] != vals[xx])
nw[++aa] = srt[i];
nw[++aa] = y;
for(int i = 1; i <= n; ++i)
if(srt[i] > y && srt[i] != vals[xx])
nw[++aa] = srt[i];
vals[xx] = y;
for(int i = 1; i <= n; ++i)
srt[i] = nw[i];
int ans = 0;
int st = 0;
for(int i = 1; i <= n;)
{
++ans;
st = srt[i];
while(i <= n && srt[i] - st <= lg)
++i;
}
// for(int i = 1; i <= n; ++i)
// cout << srt[i] << " ";
// cout << '\n';
return ans;
}
int main()
{
int N, L, X[150002];
cin >> N >> L;
for(int i = 0; i < N; ++i)
{
cin >> X[i];
}
init(N, L, X);
int M;
cin >> M;
for(int i = 0; i < M; ++i)
{
int pa, pb;
cin >> pa >> pb;
cout << update(pa, pb) << '\n';
}
return 0;
}
Compilation message
/tmp/ccn0vBDf.o: In function `main':
grader.cpp:(.text.startup+0x0): multiple definition of `main'
/tmp/ccf8QZzO.o:elephants.cpp:(.text.startup+0x0): first defined here
collect2: error: ld returned 1 exit status
