Pagini recente » Cod sursa (job #1810749) | Cod sursa (job #2225339) | Cod sursa (job #828006) | Cod sursa (job #2471452) | Cod sursa (job #205140)
Cod sursa(job #205140)
#include<fstream>
using namespace std;
int a[500009];
int b[500009];
int main(){
int n, k, i, vf, ult,x,pi,psf,bmax, pas;
ifstream f("secventa.in");
f>>n>>k;
vf=0;
ult=-1;
for(i=0;i<k;i++){
f>>x;
for(pas=1;ult-(pas<<1)>=vf;pas<<=1);
for(;ult>=vf;pas>>=1)
if(a[ult-pas]>x && (ult-pas)>=vf)
ult-=pas;
if(ult<vf)
ult=vf=0;
else
++ult;
a[ult]=x;
b[ult]=i+1;
}
pi=1;psf=k;bmax=a[vf];
for(i=k+1;i<=n;i++){
if(b[vf]<i-k+1) vf++;
f>>x;
for(pas=1;ult-(pas<<1)>=vf;pas<<=1);
for(;ult>=vf;pas>>=1)
if(a[ult-pas]>x && (ult-pas)>=vf)
ult-=pas;
//while(a[ult]>x && ult>=vf) ult--;
if(ult<vf)
ult=vf;
else ++ult;
a[ult]=x;
b[ult]=i;
if(a[vf]>bmax){bmax=a[vf];psf=i;pi=i-k+1;}
}
f.close();
ofstream g("secventa.out");
g<<pi<<' '<<psf<<' '<<bmax<<'\n';
g.close();
return 0;
}