Pagini recente » Cod sursa (job #1880066) | Cod sursa (job #1518950) | Cod sursa (job #2731387) | Cod sursa (job #1855698) | Cod sursa (job #2938226)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("secventa.in");
ofstream fout("secventa.out");
int main()
{
long long n,k,a[500001],baza=-30000,ifinal=0,jfinal=0;
deque<int> d;
fin>>n>>k;
for(int i=1;i<=n;i++){
fin>>a[i];
while(!d.empty() && a[d.back()]>a[i])
d.pop_back();
if(!d.empty() && d.front()==i-k)
d.pop_front();
d.push_back(i);
if(i>=k && baza<a[d.front()]){
baza=a[d.front()];
/*
cout<<"!!CAZ <: \n";
cout<<"baza: "<<baza<<"\n";
cout<<"d.front(): "<<d.front()<<"\n";
cout<<"i: "<<i<<"\n";
cout<<"\n";
*/
ifinal=i-k+1;
jfinal=i;
}
else if(i>=k && baza==a[d.front()]){
/*
cout<<"!!CAZ ==: \n";
cout<<"baza: "<<baza<<"\n";
cout<<"i: "<<i<<"\n";
cout<<"\n";
*/
ifinal=i-k+1;
jfinal=i;
}
}
fout<<ifinal<<" "<<jfinal<<" "<<baza;
return 0;
}