Cod sursa(job #238191)
| Utilizator | Data | 31 decembrie 2008 20:58:27 | |
|---|---|---|---|
| Problema | Secventa | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.48 kb |
#include <fstream>
using namespace std;
ifstream f ("secventa.in");
ofstream g ("secventa.out");
int main()
{
long long n,k;
int v[500000],min_max,min,i,j,x;
f>>n>>k;
for(i=0;i<n;i++) f>>v[i];
min_max=v[0];
for(i=0;i<n-k+1;i++)
{
min=v[i];
for(j=i;j<i+k;j++) if(v[j]<min) min=v[j];
if(min>min_max) min_max=min,x=i;
}
g<<x+1<<" "<<x+k<<" "<<min_max;
f.close();
g.close();
return 0;
}
