Pagini recente » Cod sursa (job #1161687) | Cod sursa (job #383213) | Cod sursa (job #2812831) | Cod sursa (job #966354) | Cod sursa (job #803879)
Cod sursa(job #803879)
# include <deque>
# include <fstream>
# define NMAX 500001
# define VAL -30001
using namespace std;
int N, K, pmax = VAL, p;
int A[NMAX];
ifstream fin("secventa.in");
ofstream fout("secventa.out");
int main()
{
fin >> N >> K;
for(int i = 1; i <= N; ++ i) fin >> A[i];
deque<int> Q;
for(int i = 1; i <= N; ++ i)
{
while(Q.size() && A[i] <= A[Q.back()])
Q.pop_back();
Q.push_back(i);
if(i-K == Q.front()) Q.pop_front();
if(i >= K && pmax < A[Q.front()])
pmax = A[Q.front()], p = Q.front();
}
fout << p-K+1 << ' ' << p << ' ' << pmax << '\n';
return 0;
}