Pagini recente » Cod sursa (job #1415453) | Cod sursa (job #2477134) | Cod sursa (job #2139228) | Cod sursa (job #2269498) | Cod sursa (job #2529248)
#include<fstream>
using namespace std;
int n,k,i,mi[500001],v[500001],ma,p,u,st,dr;
FILE *f;
f = fopen("secventa.in","r");
ofstream g("secventa.out");
int main()
{
fscanf(f,"%d%d",&n,&k);
ma = -30001;
for(i = 1;i <= n; ++i)
fscanf(f,"%d",&v[i]);
p = u = 1;
mi[p] = 1;
for(i = 2; i <= n; ++i)
{
while(p <= u && v[i] <= v[mi[u]])
u--;
u++;
mi[u] = i;
while(p <= u && i - mi[p] >= k)
p++;
if(v[mi[p]] > ma && i >= k)
{
ma = v[mi[p]];
dr = i;
}
}
g << dr - k + 1 << " " << dr << " " << ma;
return 0;
}