Pagini recente » Cod sursa (job #2424962) | Clasament jbfejoeg | Cod sursa (job #2394810) | Cod sursa (job #701073) | Cod sursa (job #2391127)
#include <fstream>
#include <deque>
#define N 500010
#define intt int
using namespace std;
ifstream f("secventa.in");
ofstream g("secventa.out");
intt v[N], ans, sol= -30001, solstart, solfinish;
int dif = 30001;
int n, k;
deque <int> Q;
int main()
{
f >> n >> k;
for(intt i = 1; i <= n; ++i)
f >> v[i], v[i] += dif;
for(intt i = 1; i <= n ; ++i )
{
while(!Q.empty() && v[i] <= v[Q.back()] ) Q.pop_back();
Q.push_back(i);
if(Q.front() == i-k) Q.pop_front();
if(i >= k)
{
if(sol < v[Q.front()])
{
sol = v[Q.front()];
solfinish = i;
solstart = i - k + 1;
}
}
}
g << solstart << ' ' << solfinish << ' ' << sol-dif;
f.close(); g.close();
return 0;
}