Pagini recente » Cod sursa (job #789591) | Cod sursa (job #2678494) | Cod sursa (job #266994) | Cod sursa (job #2211774) | Cod sursa (job #1641287)
#include <fstream>
using namespace std;
ifstream fin ("secventa.in");
ofstream fout ("secventa.out");
int n,k,u,p,v[5000005],deq[5000005],i,maxv,a,b;
long long s;
int main()
{
fin >> n >> k ;
for (i=1;i<=n;i++) fin >> v[i];
for (i=1;i<=n;i++)
{
while (p<=u && v[i]<=v[deq[u]])
{
--u;
}
deq[++u]=i;
if (deq[p]==i-k)
p++;
if (i>=k && v[deq[p]] > maxv)
{
maxv=v[deq[p]];
a=i-k+1;
b=i;
}
}
fout <<a<<' '<<b<<' '<<maxv<<endl;
return 0;
}