Pagini recente » Cod sursa (job #1732898) | Cod sursa (job #715914) | Cod sursa (job #151884) | Cod sursa (job #1775128) | Cod sursa (job #1279703)
#include <iostream>
#include <fstream>
#define maxn 500050
using namespace std;
ifstream f("secventa.in");
ofstream g("secventa.out");
int v[maxn], d[maxn], m = 1<<30, i, n, k, u, p, a, b, aux, poz, semn;
char s[maxn];
void chg()
{
int semn, j, r;
j = 1;
for (int i = 0; s[i] != 0; i++)
{
semn = 1;
r = 0;
if (s[i] == '-')
{
semn = -1;
i++;
}
while (s[i] >= '0' && s[i] <= '9')
{
r = r * 10 + s[i] - '0';
i++;
}
v[j] = r * semn;
j++;
}
}
int main()
{
f >> n >> k;
f.get();
f.getline(s, 5000100);
chg();
m = -m;
p = 1;
u = 1;
d[u] = 1;
for (i = 2; i <= n; i++)
{
while (v[i] <= v[d[u]] && p <= u)
u--;
d[++u] = i;
if (i - d[p] == k)
p++;
if (i >= k)
{
if (m < v[d[p]])
{
m = v[d[p]];
a = d[u];
}
}
}
g << a - k + 1 << " " << a << " " << m;
return 0;
}