Pagini recente » Cod sursa (job #920144) | Cod sursa (job #2026656) | Cod sursa (job #904558) | Cod sursa (job #2962684) | Cod sursa (job #1064744)
#include <fstream>
using namespace std;
ifstream f("secventa.in");
ofstream g("secventa.out");
int n, k, elem, a[500001], deq[500001], i, st=1, dr, j, Max=-30010, sts, drs;
int main()
{
f>>n>>k;
for (i=1; i<=n; i++)
f>>a[i];
for (i=1; i<=n; i++)
{
while (st<=dr && a[i] <= a[deq[dr]])
dr--;
deq[++dr]=i;
if (i-k == deq[st])
st++;
if (i>=k)
{
if (a[deq[st]] > Max)
{
Max=a[deq[st]];
drs=i;
}
}
}
g<<drs-k+1<<" "<<drs<<" "<<Max;
return 0;
}