Pagini recente » Cod sursa (job #1039999) | Cod sursa (job #904408) | Cod sursa (job #3276426) | Cod sursa (job #2320804) | Cod sursa (job #988888)
Cod sursa(job #988888)
#include<cstdio>
#define LMAX 500100
int n,k;
int x[LMAX],q[LMAX];
using namespace std;
#define DIM 10000
char buff[DIM];
int poz=0;
void citeste(int &numar)
{
numar = 0;
char semn='+';
while (buff[poz] < '0' || buff[poz] > '9')
{
semn = buff[poz];
if (++poz == DIM)
fread(buff,1,DIM,stdin),poz=0;
}
while ('0'<=buff[poz] && buff[poz]<='9')
{
numar = numar*10 + buff[poz] - '0';
if (++poz == DIM)
fread(buff,1,DIM,stdin),poz=0;
}
if (semn == '-')
numar = -numar;
}
void read()
{
int i;
freopen("secventa.in", "r", stdin);
freopen("secventa.out", "w", stdout);
citeste(n); citeste(k);for (i = 1; i <= n; ++i)
citeste(x[i]);
}
void solve()
{
int p=1,u=0,i,poz,max=poz=-(1<<25);
for(i=1;i<=n;i++)
{
while(p<=u && x[i]<=x[q[u]])
u--;
q[++u]=i;
if(q[p]+k==i)
p++;
if(i>=k)
if(x[q[p]]>max)
max=x[q[p]],poz=i;
}
printf("%d %d %d", poz-k+1, poz, max);
}
int main()
{
read();
solve();
return 0;
}