Pagini recente » Cod sursa (job #592840) | Cod sursa (job #2036747) | Cod sursa (job #151467) | Cod sursa (job #1815844) | Cod sursa (job #374792)
Cod sursa(job #374792)
#include<cstdio>
#include<string>
const int N=1<<19;
const int M=1<<24;
int n,k,v[N],dq[N],st=0,dr=-1;
char s[M];
inline void stanga(int i)
{
if (i-dq[st]==k)
++st;
}
inline void dreapta(int i)
{
while (st<=dr && v[i]<=v[dq[dr]])
--dr;
dq[++dr]=i;
}
int main()
{
freopen("secventa.in","r",stdin);
freopen("secventa.out","w",stdout);
scanf("%d%d\n",&n,&k);
fgets(s,7*n,stdin);
//gets(s);
int x=0,nr=0,semn=1;
for (int i=0;s[i] && s[i]!='\n';i++)
{
if (s[i]=='-')
{
semn=-1;
continue;
}
if (s[i]==' ')
{
nr++;
v[nr]=x*semn;
x=0;
semn=1;
continue;
}
x=x*10+(int)s[i]-(int)'0';
}
if (nr!=n)
{
nr++;
v[nr]=x*semn;
}
for (int i=1;i<k;i++)
dreapta(i);
int max=-30001,incep,sfarsit;
for (int i=k;i<=n;i++)
{
stanga(i);
dreapta(i);
if (v[dq[st]]>max)
{
incep=i-k+1;
sfarsit=i;
max=v[dq[st]];
}
}
printf("%d %d %d",incep,sfarsit,max);
return 0;
}