Pagini recente » Cod sursa (job #2969753) | Cod sursa (job #1765197) | Cod sursa (job #1143649) | Cod sursa (job #750208) | Cod sursa (job #421119)
Cod sursa(job #421119)
#include<fstream>
#define maxn 500003
#define INFI 2000000000
using namespace std;
int n, k, st, dr;
int a[maxn], deq[maxn];
int minmax=-INFI, ri, rj;
int main()
{
int i;
ifstream fin("secventa.in");
ofstream fout("secventa.out");
fin>>n>>k;
for(i=1;i<=n;i++)
fin>>a[i];
st=1, dr=0;
for(i=1;i<=n;i++)
{
while(st<=dr && a[i]<=a[deq[dr]])
dr--;
deq[++dr]=i;
if(deq[st]==i-k)
st++;
if(i>=k)
if(a[deq[st]]>minmax)
{
minmax=a[deq[st]];
ri=i-k+1;
rj=i;
}
}
fout<<ri<<" "<<rj<<" "<<minmax;
return 0;
}