Pagini recente » Cod sursa (job #2955185) | Cod sursa (job #2402875) | Cod sursa (job #988692) | Cod sursa (job #2166073) | Cod sursa (job #778175)
Cod sursa(job #778175)
#include<fstream>
#define maxn 500005
using namespace std;
ifstream in("secventa.in");
ofstream out("secventa.out");
int v[maxn],d[maxn];
int back,front,sol=-1<<30,l,r;
int n,k;
void read()
{
in>>n>>k;
front=1;
for(int i=1;i<=n;i++)
{
in>>v[i];
while(v[i]<v[d[back]] && front<=back) back--;
d[++back]=i;
if(v[d[front]]>sol && i>=k) sol=v[d[front]],r=i,l=r-k+1;
if(d[back]-d[front]+1>=k)
{
front++;
}
}
}
int main()
{
read();
out<<l<<" "<<r<<" "<<sol;
}