Pagini recente » Cod sursa (job #2823792) | Cod sursa (job #2218566) | Cod sursa (job #1619189) | Cod sursa (job #1246215) | Cod sursa (job #2702001)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("secventa.in");
ofstream fout("secventa.out");
int n, k, a[500005], M;
char s[3800000];
deque<int>q;
int main()
{
int i, p, j=0, x, semn;
fin >> n >> k;
fin.get();
fin.getline(s, 3800000);
for(i=0; s[i]!=0;)
{
x=0;
semn=0;
if(s[i]==' ') i++;
else if(s[i]=='-')
{
semn= 1;
i++;
}
else
{
while('0'<=s[i]&&s[i]<='9')
{
x=x*10+s[i]-'0';
i++;
}
if(semn==1) a[++j]=-x;
else a[++j]=x;
}
}
fin >> a[i];
for(i=1; i<=k; i++)
{
x=a[i];
while(!q.empty()&&a[q.back()]>=x)
q.pop_back();
q.push_back(i);
}
M=a[q.front()];
p=i;
for(i=k+1; i<=n; i++)
{
x=a[i];
while(!q.empty()&&a[q.back()]>=x)
q.pop_back();
q.push_back(i);
if(i-k==q.front()) q.pop_front();
if(a[q.front()]>M)
{
M=a[q.front()];
p=i;
}
}
fout << p-k+1 << " " << p << " " << M;
return 0;
}