Pagini recente » Cod sursa (job #381901) | Cod sursa (job #1925081) | Cod sursa (job #1939695) | Cod sursa (job #450622) | Cod sursa (job #1439426)
using namespace std;
#include <fstream>
#include <algorithm>
ifstream f("secventa.in");
ofstream g("secventa.out");
int v[500002], k, n, c[500002];
int st=1, dr=1, m=-30001, tm=0;
void minim(int t)
{
int i, minim=30001, tminim;
for(i=t; i<=t+k-1; i++)
if(c[i]<minim) {minim=c[i]; tminim=i;}
if(minim>m) {m=minim; tm=tminim;}
}
int main()
{
int i;
f>>n>>k;
for(i=1; i<=n; i++)
f>>v[i];
for(i=1; i<=k; i++)
c[i]=v[i];
dr=k;
while(dr<=n)
{
minim(st);
st++;
dr++;
c[dr]=v[dr];
}
g<<tm<<' '<<tm+k-1<<' '<<m;
return 0;
}