Pagini recente » Cod sursa (job #1516128) | Cod sursa (job #1836480) | Cod sursa (job #1379789) | Cod sursa (job #920401) | Cod sursa (job #2498316)
#include <fstream>
#define NMax 600005
using namespace std;
ifstream fin ("secventa.in");
ofstream fout ("secventa.out");
int n, k, v[NMax], Deque[NMax], maxim = -50000, posi, poss;
int main()
{
int i;
fin >> n >> k;
for (i = 1; i <= n; i++)
fin >> v[i];
int Front = 1, Back = 0;
for (i = 1; i <= n; i++) {
while (Front <= Back && v[i] <= v[ Deque[Back] ])
Back--;
Deque[++Back] = i;
if (Deque[Front] == i-k) Front++;
if (i >= k) {
if (maxim < v[ Deque[Front] ]) {
maxim = v[Deque[Front]];
posi = i-k+1;
poss = i;
}
}
}
fout << posi << " " << poss << " " << maxim;
return 0;
}