Pagini recente » Istoria paginii utilizator/antonio.salaru | Cod sursa (job #896985) | Statistici Adnrei Ig. (igiat) | Istoria paginii runda/incercam/clasament | Cod sursa (job #2046155)
#include <fstream>
using namespace std;
ifstream cin ("secventa.in");
ofstream cout("secventa.out");
int v[5000005], d[5000005];
int main()
{
int n,k,st,dr,i,drmax,stmax,maxim=-999999999;
long long s=0;
cin>>n>>k;
st=0;
dr=-1;
for(int i=0; i<n; i++)
{
cin>>v[i];
if(st<=dr && d[st]==i-k)
++st;
while(st<=dr && v[i]<=v[d[dr]])
--dr;
d[++dr]=i;
if(i>=k-1)
if(v[d[st]]>maxim)
{
maxim=v[d[st]];
drmax=i+1;
stmax=i-k+2;
}
}
cout<<stmax<<' '<<drmax<<' '<<maxim;
return 0;
}