Pagini recente » Cod sursa (job #1139981) | Cod sursa (job #826571) | Cod sursa (job #2495731) | Cod sursa (job #3135223) | Cod sursa (job #1907541)
#include <fstream>
#include <deque>
using namespace std;
ifstream f ("secventa.in");
ofstream g ("secventa.out");
int v[5000001],s,i,n,k,mare=-10000000,st,dr,dist;
deque <int> d;
int main()
{
f>>n>>k;
for(i=1;i<=n;++i) f>>v[i];
d[0]=1;
for(i=2;i<=n;++i)
{
while(!d.empty()&&v[i]<=v[d[d.size()-1]]) d.pop_back();
d.push_back(i);
while(!d.empty()&&i-d[0]>=k) d.pop_front();
if(v[d[0]]>mare&&i>=k)
{
mare=v[d[0]];
dr=i;
}
}
g<<dr-k+1<<' '<<dr<<' '<<mare;
return 0;
}