Cod sursa(job #1154433)
Utilizator | Bejenariu Ionut Daniel ionut98 | Data | 26 martie 2014 10:19:39 |
---|---|---|---|
Problema | Secventa | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.51 kb |
#include<fstream>
using namespace std;
int lg,n,a[500001],i,st,min1,max1=-30002,maxst;
int main()
{
ifstream f("secventa.in");
ofstream g("secventa.out");
f>>n>>lg;
for(i=1;i<=n;i++)
f>>a[i];
st=1;
while(st<=n-lg+1)
{
min1=30002;
for(i=st;i<=st+lg-1;i++)
min1=min(min1,a[i]);
if(min1>max1)
{
max1=min1;
maxst=st;
}
st++;
}
g<<maxst<<" "<<maxst+lg-1<<" "<<max1;
return 0;
}