Pagini recente » Cod sursa (job #2536880) | Cod sursa (job #3124782) | Cod sursa (job #2762128) | Cod sursa (job #1639082) | Cod sursa (job #1154384)
#include<fstream>
using namespace std;
int a[500001],c[500001];
int n,k,u,mx,p,i,x;
int main()
{
ifstream f("secventa.in");
ofstream g("secventa.out");
ios_base::sync_with_stdio(0);
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;
}