Cod sursa(job #527557)
| Utilizator | Data | 31 ianuarie 2011 21:11:12 | |
|---|---|---|---|
| Problema | Secventa | Scor | 30 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.47 kb |
#include<iostream.h>
#include<fstream.h>
long n,k;
int a[500000];
int baza(int i)
{
int min;
long j;
min=a[i];
for(j=i;j<=i+k-1;j++)
if(a[j]<min)
min=a[j];
return min;
}
int main()
{
fstream f("secventa.in", ios::in);
fstream g("secventa.out", ios::out);
long i,j;
f>>n>>k;
int max;
for(i=1;i<=n;i++)
f>>a[i];
max=baza(1);
for(i=2,j=1;i<=n-k+1;i++)
if(baza(i)>max)
{
max=baza(i);
j=i;
}
g<<j<<" "<<j+k-1<<" "<<max;
}