Pagini recente » Cod sursa (job #141294) | Cod sursa (job #1759952) | Cod sursa (job #1392772) | Cod sursa (job #1806227) | Cod sursa (job #2538425)
#include <fstream>
#include <deque>
using namespace std;
ifstream f("secventa.in");
ofstream g("secventa.out");
int n, k, i;
int v[500001];
char c[3500000];
int rez = -2000000000;
int st, dr;
deque < int > coada;
int main()
{
f >> n >> k;
f.get();
f.getline(c, sizeof(c));
n = 0;
int aux;
bool semn;
for (i=0; c[i]; i++)
if (c[i] >= '0' && c[i] <= '9')
{
if (c[i-1] == '-')
semn = false;
else
semn = true;
aux = 0;
while (c[i] >= '0' && c[i] <= '9')
{
aux = aux * 10 + c[i] - '0';
i++;
}
if (!semn)
aux = -aux;
n++, v[n] = aux;
}
for (i=1; i<=n; i++)
{
while (!coada.empty() && v[i] <= v[coada.back()])
coada.pop_back();
coada.push_back(i);
if (coada.front() == i-k)
coada.pop_front();
if (i >= k && v[coada.front()] > rez)
{
rez = v[coada.front()];
st = i - k + 1;
dr = i;
}
}
g << st << " " << dr << " " << rez;
return 0;
}