Pagini recente » Cod sursa (job #1990888) | Cod sursa (job #2043007) | Cod sursa (job #213892) | Cod sursa (job #1866771) | Cod sursa (job #2701902)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("secventa.in");
ofstream fout("secventa.out");
int n, k, a[500005];
char s[4000005];
deque <int> d;
int main()
{
int i, semn = 0, x, cnt = 0, ma = INT_MIN, p;
fin >> n >> k;
fin.get();
fin.getline(s, 4000000);
for (i = 0; s[i];)
{
if (s[i] == '-')
{
semn = 1;
i++;
}
else if (s[i] == ' ')
{
i++;
}
else if (isdigit(s[i]))
{
while (isdigit(s[i]))
{
x = x * 10 + s[i] - '0';
i++;
}
if (semn == 1) x *= -1;
a[++cnt] = x;
semn = 0;
x = 0;
}
}
p = k;
for (i = 1; i <= n; i++)
{
while (!d.empty() and a[d.back()] >= a[i])
d.pop_back();
d.push_back(i);
if (d.front() <= i - k)
d.pop_front();
if (a[d.front()] > ma and i >= k)
{
ma = a[d.front()];
p = i;
}
}
fout << p - k + 1 << " " << p << " " << ma;
return 0;
}