Pagini recente » Cod sursa (job #961833) | Cod sursa (job #569474) | Cod sursa (job #1703058) | Cod sursa (job #697303) | Cod sursa (job #638947)
Cod sursa(job #638947)
#include <fstream>
using namespace std;
ifstream f("secventa.in");
ofstream g("secventa.out");
int i,k,n,p,poz,Y,T,m,a[500003],d[500006];
int main()
{
f>>n>>k;
m=-30005;
for(i=1; i<=n; i++) f>>a[i];
a[0]=-3333333;
T=1;
for(i=1; i<=n; i++)
{
while (a[i]<=a[d[poz]])
{
poz--;
}
poz++;
d[poz]=i;
if (i-d[T]>=k)
T++;
if (a[d[T]]>=m&&i>=k)
{
m=a[d[T]];
Y=i;
}
}
g<<Y-k+1<<" "<<Y<<" "<<m;
f.close();
g.close();
return 0;
}