Pagini recente » Cod sursa (job #53364) | Cod sursa (job #492693) | Cod sursa (job #1607931) | Cod sursa (job #1842869) | Cod sursa (job #464545)
Cod sursa(job #464545)
#include<fstream>
#include<deque>
using namespace std;
ifstream f("secventa.in") ; ofstream g("secventa.out");
int v[500001],sol;
int i,n,k,b,e;
deque<int>vmin;
int main()
{ f>>n>>k;
sol=-31000;
for(i=1;i<=n;i++)
f>>v[i];
for(i=1;i<=n;i++)
{ while(!vmin.empty() && v[vmin.back()]>v[i])
vmin.pop_back();
vmin.push_back(i);
if(i>=k&&sol<v[vmin.front()])
e=i,b=i-k+1 , sol=v[vmin.front()];
if(vmin.front()<=i-k+1)
vmin.pop_front();
}
g<<b<<" "<<e<<" "<<sol;
f.close();
g.close();
return 0;
}