Pagini recente » Cod sursa (job #660150) | Profil eudanip | Cod sursa (job #673743) | Cod sursa (job #937444) | Cod sursa (job #861390)
Cod sursa(job #861390)
#include<fstream>
using namespace std;
short int a[500001],c[500001],n,k,u,mx,p,i,x;
int main()
{
ifstream f("secventa.in");
ofstream g("secventa.out");
f >> n >> k;
for (i=1;i<=n;i++)
f >> a[i];
p=1;u=0;mx=-30001;
for (i=1;i<=n;i++)
{
while ((u>=p) && (a[i]<c[u]))
u--;
c[++u]=a[i];
if (i>=k)
{
if ((i>k) && (a[i-k]==c[p]))
p++;
if (c[p]>mx)
{
mx=c[p];
x=i;
}
}
}
g << x-k+1 << ' ' << x << ' ' << mx;
return 0;
}