Pagini recente » Cod sursa (job #2542211) | Cod sursa (job #2112533) | Cod sursa (job #1245184) | Cod sursa (job #1326538) | Cod sursa (job #2121684)
#include<fstream>
#include<iostream>
#include<cctype>
#include<cstring>
#include<vector>
#include<algorithm>
#define pb push_back
#define x first
#define y second
#include<deque>
#include<cstring>
#define DN 500005
using namespace std;
ifstream fin("secventa.in");
ofstream fout("secventa.out");
int n,k,a[DN],st,dr,ma=-(1<<28),semn=1,poz,f;
deque<pair<int,int> >d;
char s[7*DN];
int main()
{
fin>>n>>k;
fin.getline(s,7*DN);
fin.getline(s,7*DN);
f=strlen(s);
for(int i=0;i<f;i++)
{
if(s[i]==' '||i==0)
{
a[poz]*=semn;
semn=1;
poz++;
}
if(s[i]=='-')
semn=-1;
if(isdigit(s[i]))
a[poz]=a[poz]*10+s[i]-'0';
}
a[n]*=semn;
for(int i=1;i<=n;i++)
{
while(1)
{
if(d.empty())
break;
if(d.back().y<a[i])
break;
d.pop_back();
}
d.pb({i,a[i]});
while(1)
{
if(d.empty())
break;
if(d.front().x>=i-k+1)
break;
d.pop_front();
}
if(i>=k)
{
if(d.front().y>ma)
{
ma=d.front().y;
st=i-k+1;
dr=i;
}
}
}
fout<<st<<' '<<dr<<' '<<ma;
}