Pagini recente » Cod sursa (job #2033271) | Cod sursa (job #60007) | Cod sursa (job #2457042) | Cod sursa (job #1555932) | Cod sursa (job #1640213)
#include <fstream>
#include <deque>
using namespace std;
ifstream fin("secventa.in");
ofstream fout("secventa.out");
int i,a[500005],n,k,mi,poz;
deque <int> d;
int main()
{
fin>>n>>k;
for(i=1;i<=k;i++)
{
fin>>a[i];
while(!d.empty()&&a[d.back()]>a[i])
d.pop_back();
d.push_back(i);
}
mi=d.front();
poz=k;
for(i=k+1;i<=n;i++)
{
fin>>a[i];
while(!d.empty()&&a[d.back()]>a[i])
d.pop_back();
d.push_back(i);
if(i-d.front()>=k)
d.pop_front();
if(mi<a[d.front()])
{
poz=i;
mi=a[d.front()];
}
}
fout<<poz-k+1<<" "<<poz<<" "<<mi;
return 0;
}