Pagini recente » Cod sursa (job #1896611) | Cod sursa (job #2325978) | Cod sursa (job #2160395) | Cod sursa (job #1251470) | Cod sursa (job #1468653)
/*http://www.infoarena.ro/problema/secventa*/
#include <cstdio>
#include <deque>
using namespace std;
deque<int> Q;
short v[500000];
int main()
{
int n, k, d, i, rez=-30000;
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=0; i<k; ++i)
{
while(!Q.empty() && v[Q.back()] > v[i]) Q.pop_back();
Q.push_back(i);
}
for(i=k; i<n; ++i)
{
while(!Q.empty() && v[Q.back()] > v[i]) Q.pop_back();
Q.push_back(i);
if(v[Q.front()] > rez)
{
rez = v[Q.front()];
d = i;
}
/*
printf("\n");
for(int j=0; j<Q.size(); ++j)
printf("%d ", v[Q[j]]);*/
if(i - Q.front() >= k) Q.pop_front();
}
printf("%d %d %d\n", d-k+1, d+1, rez);
return 0;
}