Cod sursa(job #131767)
| Utilizator | Data | 4 februarie 2008 14:09:47 | |
|---|---|---|---|
| Problema | Secventa | Scor | 30 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.4 kb |
#include<fstream.h>
long n,i,j,k,min,max,p1,p2,a[500001];
ifstream f("secventa.in");
ofstream g("secventa.out");
int main()
{
f>>n>>k;
max=-32000;
for(i=1;i<=n;i++)
f>>a[i];
for(i=1;i<=n-k+1;i++)
{
min=32000;
for(j=i;j<=i+k-1;j++)
if(a[j]<min)
min=a[j];
j--;
if (min>max)
{
max=min;
p1=i;
p2=j;
}
}
g<<p1<<" "<<p2<<" "<<max<<'\n';
f.close();
g.close();
return 0;
}
