Pagini recente » Cod sursa (job #1891636) | Cod sursa (job #31514) | Cod sursa (job #31504) | Cod sursa (job #2066906) | Cod sursa (job #2046202)
#include <fstream>
#include <deque>
using namespace std;
ifstream fin("secventa.in");
ofstream fout("secventa.out");
int n,k;
int a[500005];
int maxx=-50000;
int ssec,fsec;
deque <int> d;
void Read()
{
fin>>n>>k;
for(int i=1; i<=n; ++i)
fin>>a[i];
fin.close();
}
void Do()
{
for(int i=1; i<=n; ++i)
{
while(!d.empty() && a[i]<=a[d.back()])
d.pop_back();
d.push_back(i);
if(i-k==d.front()) d.pop_front();
if(i>=k)
if(a[d.front()]>maxx) { maxx=a[d.front()];
ssec=i-k+1;
fsec=i;
}
}
}
void Print()
{
fout<<ssec<<' '<<fsec<<' '<<maxx<<'\n';
fout.close();
}
int main()
{
Read();
Do();
Print();
return 0;
}