Pagini recente » Cod sursa (job #211920) | Cod sursa (job #672454) | Cod sursa (job #1543941) | Cod sursa (job #684381) | Cod sursa (job #847965)
Cod sursa(job #847965)
#include <fstream>
#define NMax 1000003
using namespace std;
ifstream f("secventa.in");
ofstream g("secventa.out");
int a[NMax], deque[NMax],i,k,n,p,u,pi,pf,maxi;
int main()
{
f>>n>>k;
for(i=1; i<=n; i++) f>>a[i];
p=1;u=0;
for(i=1; i<=n; i++)
{
while(p<=u && a[i]<= a[deque[u]]) u--;
deque[++u]=i;
if(deque[p]==i-k) p++;
if(i>=k) if(maxi<a[deque[p]]){pi=i-k+1;pf=i;maxi=a[deque[p]];}
}
g<<pi<<" "<<pf<<" "<<maxi<<'\n';
return 0;
}