Pagini recente » Cod sursa (job #2980424) | Cod sursa (job #355422) | Cod sursa (job #2667768) | Cod sursa (job #2886689) | Cod sursa (job #1468657)
/*http://www.infoarena.ro/problema/secventa*/
#include <cstdio>
#define N 500000
using namespace std;
int Q[N];
short v[N];
int main()
{
int n, k, d, i, rez=-30000, p=0, u=-1;
freopen("secventa.in", "r", stdin);
freopen("secventa.out", "w", stdout);
scanf("%d %d", &n, &k);
for(i=0; i<n; ++i)
scanf("%d", &v[i]);
k--;
for(i=k; i<n; ++i)
{
while(p<=u && v[Q[u]] > v[i]) --u;
Q[++u] = i;
if(i>=k && v[Q[p]] > rez)
{
rez = v[Q[p]];
d = i;
}
/*
printf("\n");
for(int j=0; j<Q.size(); ++j)
printf("%d ", v[Q[j]]);*/
if(i - Q[p] >= k) ++p;
}
printf("%d %d %d\n", d-k+1, d+1, rez);
return 0;
}