Cod sursa(job #362857)
| Utilizator | Data | 11 noiembrie 2009 10:30:00 | |
|---|---|---|---|
| Problema | Secventa | Scor | 20 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.44 kb |
#include<iostream>
#include<fstream>
using namespace std;
int main()
{
ifstream f("secventa.in");
ofstream g("secventa.out");
int n,i,a[500005],k,m,ps,pi;
f>>n;
f>>k;
for(i=1;i<=n;i++)
f>>a[i];
m = -30004;
for(i=1;i<=n-k+1;i++)
{
if(*min_element(a+i,a+i+k+1) > m)
{
pi=i;
ps=i+k-1;
m = *min_element(a+i,a+i+k+1);
}
}
g<<pi<<" "<<ps<<" "<<m<<"\n";
f.close();
g.close();
return 0;
}
