Pagini recente » Cod sursa (job #818851) | Cod sursa (job #920163) | Cod sursa (job #919260) | Cod sursa (job #1310676) | Cod sursa (job #2307661)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("secventa.in");
ofstream g("secventa.out");
int maxi=-300003,ps,pd;
int main()
{
int n,i,j,k,mini,v[500001];
f>>n>>k;
for(i=1; i<=n; i++)
f>>v[i];
for(i=1; i<=n-k+1; i++)
{
mini=300001;
for(j=i; j<i+k; j++)
if(v[j]<mini)
mini=v[j];
if(mini>maxi)
{
maxi=mini;
ps=i;
pd=i+k-1;
}
else
if(mini==maxi)
if(i<ps)
ps=i;
else
if(i==ps)
if(i+k-1<pd)
pd=i+k-1;
}
g<<ps<<" "<<pd<<" "<<maxi;
return 0;
}