Pagini recente » Cod sursa (job #2622597) | Cod sursa (job #699784) | Cod sursa (job #105807) | Cod sursa (job #2720026) | Cod sursa (job #1181174)
#include <fstream>
#include <deque>
using namespace std;
deque <int> d;
ifstream fin("secventa.in");
ofstream fout("secventa.out");
int main()
{
int n,k,i,x=0,y,sol=-100000000;
fin>>n>>k;int v[n];
y=k;
for(i=1;i<=n;i++)
{
fin>>v[i];
while(!d.empty()&&v[i]<=v[d.back()]) d.pop_back();
d.push_back(i);
if(d.front()==i-k) d.pop_front();
if(v[d.front()]>sol&&i>=k)
{
sol=v[d.front()];
x=i-k+1;
y=i;
}
}
fout<<x<<" "<<y<<" "<<sol;
}