Pagini recente » Cod sursa (job #1642975) | Cod sursa (job #2749917) | Clasament nnonoonooonoooo | Cod sursa (job #2524757) | Cod sursa (job #2166831)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("secventa.in");
ofstream fout("secventa.out");
int i,x,y,v[500002],secv[500002],n,m;
int minim(int k,int p,int secv[])
{
int minn=secv[k];
for(int i=k;i<p;i++)
{
if(secv[i]<minn)
minn=secv[i];
}
return minn;
}
int main()
{
fin>>n>>m;
for(i=0;i<m;i++)
{
fin>>v[i];
secv[i]=i;
}
x=minim(0,m,v);
for(i=m;i<n;i++)
{
fin>>v[i];
y=minim(i-m+1,i+1,v);
if(y>x)
{
for(int j=0;j<m;j++)
{
secv[j]=i+j-m+2;
x=y;
}
}
}
fout<<secv[0]<<" "<<secv[m-1]<<" "<<x;
return 0;
}