Pagini recente » Cod sursa (job #1309025) | Atasamentele paginii antr9-oji | Cod sursa (job #1687629) | Cod sursa (job #1502368) | Cod sursa (job #1455856)
#include <cstdio>
#define DIM 10007
#define NMAX 500007
#define inf -100007
using namespace std;
FILE *fin, *fout;
int n, k, st = 1, dr = 0, maxn = inf, pos, temp, poz;
char buff[DIM];
struct pdeque
{
int v;
int p;
} dq[NMAX];
void citeste(int &numar)
{
numar= 0;
char semn = '+';
while(buff[poz] > '9' || buff[poz] < '0')
{
semn = buff[poz];
poz++;
if(poz == DIM)
{
poz = 0;
fread(buff, 1, DIM, stdin);
}
}
while(buff[poz] >= '0' && buff[poz] <= '9')
{
numar = numar * 10 + buff[poz] - '0';
poz++;
if(poz == DIM)
{
poz = 0;
fread(buff, 1, DIM, stdin);
}
}
if(semn == '-')
{
numar = -numar;
}
}
int main()
{
fin = freopen("secventa.in", "r", stdin);
fout = freopen("secventa.out", "w", stdout);
//scanf("%d%d", &n, &k);
citeste(n);
citeste(k);
for(int i = 1; i< k; i++)
{
//scanf("%d", &temp);
citeste(temp);
while(dr >= st && temp <= dq[dr].v) dr--;
dr++;
dq[dr].v = temp;
dq[dr].p = i;
}
for(int i = k; i<= n; i++)
{
if(dq[st].p + k <= i) st++;
//scanf("%d", &temp);
citeste(temp);
while(dr >= st && temp <= dq[dr].v) dr--;
dr++;
dq[dr].v = temp;
dq[dr].p = i;
if(dq[st].v > maxn)
{
maxn = dq[st].v;
pos = dq[dr].p;
}
}
if(dq[st].v > maxn)
{
maxn = dq[st].v;
pos = dq[dr].p;
}
printf("%d %d %d\n", pos-k+1, pos, maxn);
fclose(fin);
fclose(fout);
return 0;
}