Pagini recente » Cod sursa (job #255179) | Cod sursa (job #600388) | Cod sursa (job #2053662) | Cod sursa (job #2637927) | Cod sursa (job #2358365)
#include <fstream>
using namespace std;
ifstream fin ("secventa.in");
ofstream fout ("secventa.out");
int a[500005], dq[500005];
int main()
{
int n, k, F = 1, L = 0, mn = 30005, mx = 0;
fin >> n >> k;
int x = 1, y = k;
for(int i = 1; i <= n; ++i) fin >> a[i];
for(int i = 1; i <= k; ++i) {
dq[++L] = a[i];
mn = min(mn, a[i]);
}
mx = mn;
for(int i = k + 1; i <= n; ++i) {
if(dq[F] > mx) {
mn = 30005;
for(int j = F; j <= L && mn != dq[F - 1]; ++j)
mn = min(mn, dq[j]);
if(mn > mx) mx = mn, x = F, y = L;
++F, dq[++L] = a[i];
}
else ++F, dq[++L] = a[i];
}
if(dq[F] > mx) {
mn = 30005;
for(int j = F; j <= L && mn != dq[F - 1]; ++j)
mn = min(mn, dq[j]);
if(mn > mx) mx = mn, x = F, y = L;
}
fout << x << " " << y << " " << mx;
return 0;
}