Cod sursa(job #307658)
| Utilizator | Data | 24 aprilie 2009 16:49:25 | |
|---|---|---|---|
| Problema | Secventa | Scor | 30 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.47 kb |
#include <stdio.h>
#include <algorithm>
using namespace std;
int main()
{int q,n,k,v[500000],i,a,b,nr,max;
freopen("secventa.in","r",stdin);
freopen("secventa.out","w",stdout);
scanf("%d %d",&n,&k);
for (i=1;i<=min(n,k);i++) scanf("%d",&v[i]);
nr=0;max=-100000000;
for (i=min(n,k)+1;i<=n;i++)
{nr++;
nr=(nr-1)%k;nr++;
scanf("%d",&v[nr]);
q=*min_element(v+1,v+k+1);
if (q>max) {max=q;a=i-k+1;b=i;}
}
printf("%d %d %d",a,b,max);
return 0;}
