Pagini recente » Cod sursa (job #397745) | Cod sursa (job #397725) | Cod sursa (job #148540) | Autentificare | Cod sursa (job #110397)
Cod sursa(job #110397)
#define nx 10000
#include<stdio.h>
int d[nx], v[nx], bm, l=1, r, n, k;
void cit();
void rezolva();
void afis();
int main() {
freopen("secventa.in", "r", stdin);
freopen("secventa.out", "w", stdout);
cit();
rezolva();
afis();
return 0;
}
void cit() {
scanf("%d", &n);
scanf("%d", &k);
}
void rezolva() {
int i;
for(i=1; i<=n; i++) {
scanf("%d", &v[i]);
while(v[d[r]]>v[i] && r>=l && r>0)
r--;
d[++r]=i;
while(d[l]<i-k+1)
l++;
if(v[bm]<v[d[l]])
bm=d[l];
}
}
void afis(){
for(int i=0; i<k; i++)
printf("%d ", v[i+bm]);
}