Pagini recente » Cod sursa (job #2037909) | Cod sursa (job #3258835) | Cod sursa (job #892290) | Cod sursa (job #3129446) | Cod sursa (job #810160)
Cod sursa(job #810160)
#include <fstream>
#include <cstdio>
using namespace std;
short int v[500010];
#define max 30000;
int main()
{
ifstream in("secventa.in");
freopen("secventa.out","w",stdout);
int n,i,k;
in >> n >> k;
for(i=1;i<=n;++i)
in >> v[i];
int baza = max;
int bazamax,inceput;
for(i=1;i<=k;++i)
if(v[i] < baza)
baza = v[i];
bazamax = baza;
inceput = 1;
int j;
for(i=k+1;i<=n;++i)
{
if(v[i-k] == baza)
{
baza = max;
for(j=i-k+1;j<=i;++j)
if(v[j] < baza)
baza = v[j];
}
if(baza > bazamax)
{
inceput = i-k+1;
bazamax = baza;
}
}
printf("%d %d %d\n",inceput,inceput+k-1,bazamax);
return 0;
}