Cod sursa(job #597574)
Utilizator | Stefan Popa stefanzzz | Data | 22 iunie 2011 15:09:05 |
---|---|---|---|
Problema | Secventa | Scor | 80 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.41 kb |
#include <fstream.h>
long n,k,i,j,maxi=1;
int v[500001],max;
main(){
freopen("secventa.in", "r", stdin);
freopen("secventa.out", "w", stdout);
scanf("%ld%ld", &n, &k);
for(i=1;i<=n;i++){
scanf("%d", &v[i]);
for(j=i-1;j>=1&&j>=i-k+1&&v[j]>v[i];j--)
v[j]=v[i];}
max=v[1];
for(i=2;i<=n-k+1;i++){
if(v[i]>max){
max=v[i];
maxi=i;}}
printf("%ld %ld %d", maxi, maxi+k-1, max);}