Pagini recente » Cod sursa (job #2747781) | Cod sursa (job #1752961) | Cod sursa (job #302739) | Cod sursa (job #540837) | Cod sursa (job #1222106)
//horatiu11
# include <deque>
# include <fstream>
using namespace std;
int n,k,a[500001],pm,pM,M=-30001;
deque <int>d;
ifstream f("secventa.in");
ofstream g("secventa.out");
int main()
{
f>>n>>k;
for(int i=1;i<=n;++i)
{
f>>a[i];
while(!d.empty() && a[d.back()]>=a[i])
d.pop_back();
d.push_back(i);
if(d.front()==i-k)
d.pop_front();
if(i>=k && !d.empty() && M<a[d.front()])
{
M=a[d.front()];
pm=i-k+1;
pM=i;
}
}
g<<pm<<' '<<pM<<' '<<M<<'\n';
return 0;
}