Pagini recente » Cod sursa (job #2377988) | Cod sursa (job #1842451) | Cod sursa (job #1005635) | Cod sursa (job #2318572) | Cod sursa (job #1261579)
#include <fstream>
using namespace std;
ifstream fin("secventa.in");
ofstream fout("secventa.out");
int v[500010],d[500010],st,dr,n,p,u,i,k,Max=-4000000;
long long s;
int main(){
fin>>n>>k;
for(i=1;i<=n;i++)
{
fin>>v[i];
}
p=1;
u=1;
d[1]=1;
for(i=1;i<=n;i++)
{
while(p<=u&&v[i]<v[d[u]])
{
u--;
}
d[++u]=i;
if(d[p]==i-k)
{
p++;
}
if(i>=k)
{
if(Max<v[d[p]])
{
st=i-k+1;
dr=i;
Max=v[d[p]];
}
}
}
fout<<st<<' '<<dr<<' '<<Max;
return 0;
}