Pagini recente » Cod sursa (job #1236568) | Cod sursa (job #2414306) | Cod sursa (job #1828313) | Cod sursa (job #440853) | Cod sursa (job #2517239)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("secventa.in");
ofstream fout("secventa.out");
deque <int> d;
char s[5000000];
int a[500005];
int n,k;
int main()
{
int i,semn=1,x=0,cnt=0,ma=0,p;
fin >> n >> k;
fin.get();
fin.getline(s,5000000);
for (i=0; s[i]; )
{
if (s[i]==' ') i++;
else if (s[i]=='-') {semn=-1;i++;}
else if (isdigit(s[i]))
{
while (isdigit(s[i]))
{x=x*10+(s[i]-'0'); i++;}
x*=semn;
a[++cnt]=x;
x=0;
semn=1;
}
}
for (i=1; i<=k; i++)
{
while (!d.empty() and a[d.back()]>=a[i])
d.pop_back();
d.push_back(i);
if (d.front()<=i-k) d.pop_front();
}
ma=d.front();
p=k;
for (i=1; i<=n; i++)
{
while (!d.empty() and a[d.back()]>=a[i])
d.pop_back();
d.push_back(i);
if (d.front()<=i-k) d.pop_front();
if (ma<a[d.front()] and i>=k)
{
ma=a[d.front()];
p=i;
}
}
fout << p << " " << p-k+1 << " " << ma;
return 0;
}