Pagini recente » Cod sursa (job #1341272) | Cod sursa (job #2284630) | Cod sursa (job #2529964) | Cod sursa (job #2831218) | Cod sursa (job #1469713)
#include <cstdio>
#include <iostream>
#include <vector>
#include <set>
#include <cmath>
#include <climits>
#include <list>
#include <iomanip>
#include <cstdlib>
#include <fstream>
#include <map>
#include <algorithm>
#include <string>
#include <deque>
using namespace std;
int main() {
freopen("secventa.in", "r", stdin);
freopen("secventa.out", "w", stdout);
ios_base::sync_with_stdio(false);
cin.tie(0);
int n, k;
cin >> n >> k;
int* v = (int*)malloc((n + 1) * sizeof(int));
int* d = (int*)malloc((n + 1) * sizeof(int));
for (int i = 1; i <= n; i++)
cin >> v[i];
int ans = -30005, e, fr = 1, ba = 0;
for (int i = 1; i < k; i++) {
while (fr <= ba && v[i] <= v[d[ba]])
ba--;
d[++ba] = i;
}
for (int i = k; i <= n; i++) {
while (fr <= ba && v[i] <= v[d[ba]])
ba--;
d[++ba] = i;
if (d[fr] == i - k)
fr++;
if (v[d[fr]] > ans) {
ans = v[d[fr]];
e = i;
}
}
cout << e - k + 1 << " " << e << " " << ans;
return 0;
}