Pagini recente » Cod sursa (job #2623439) | Cod sursa (job #2646319) | Cod sursa (job #2864993) | Cod sursa (job #2671393) | Cod sursa (job #1394912)
#include <iostream>
#include <fstream>
using namespace std;
int a[500000],mi[500000],k,l,i,N,MI,j;
int main()
{
ifstream f("secventa.in");
ofstream g("secventa.out");
f>>N;
f>>k;
for(i=1;i<=N;i++)
f>>a[i];
for(i=1;i<=N-k+1;i++)
mi[i]=a[i];
for(j=i;j<=i+k;j++)
{
if(a[j]<mi[1])
{
mi[1]=a[j];
}
}
MI=mi[1];
for(i=2;i<=N;i++)
{
for(j=i;j<=i+k;j++)
{
if(a[j]<mi[i])
{
mi[i]=a[j];
}
}
if(mi[i]>MI)
{
MI=mi[i];
k=i;
l=i+2;
}
}
g<<k<<" ";
g<<l<<" ";
g<<MI;
f.close();
g.close();
return 0;
}