Pagini recente » Cod sursa (job #637072) | Cod sursa (job #1064840) | Statistici sanziana felecanu (sanziana_f) | uvs_training_1 | Cod sursa (job #1327424)
#include <stdio.h>
FILE*f=fopen("secventa.in","r"),*g=fopen("secventa.out","w");
int n, a[500003], k, x[500003];
using namespace std;
int main()
{
int p = 1, u = 0;
fscanf(f,"%d %d",&n,&k);
for(int i = 1; i <= n; i++)
{
fscanf(f,"%d",&x[i]);
}
int maxim = -300002, h = 0;
for(long i = 1; i <= n; i++)
{
while(a[u] > x[i] && p <= u)
{
u--;
}
a[++u] = x[i];
if(i >= k )
{
if(a[p] > maxim)
{
h = i;
maxim = a[p];
}
}
if(x[i-k+1] == a[p] && i >= k)
p++;
}
fprintf(g,"%d %d %d",h-k+1, h, maxim);
// fprintf(g,"%lld", s);
return 0;
}