Pagini recente » Cod sursa (job #2576883) | Cod sursa (job #2532869) | Cod sursa (job #2426043) | Cod sursa (job #2948596) | Cod sursa (job #2277224)
#include <fstream>
#include <deque>
using namespace std;
ifstream fin("secventa.in");
ofstream fout("secventa.out");
const int NMAX=500000;
int v[NMAX+5];
deque<int>q;
int main()
{
int n, i, k, el_max, pozi, pozf;
el_max=-2000000000;
fin>>n>>k;
for(i=1;i<=n;i++)
{
fin>>v[i];
}
for(i=1;i<=n;i++)
{
while(!q.empty() and v[i]<=v[q.back()])
q.pop_back();
q.push_back(i);
if(i-k>=q.front())
q.pop_front();
if(i>=k and v[q.front()]>el_max)
{
el_max=v[q.front()];
pozi=i-k+1;
pozf=i;
}
}
fout<<pozi<<" "<<pozf<<" "<<el_max<<"\n";
return 0;
}