Cod sursa(job #234234)
Utilizator | Data | 20 decembrie 2008 13:40:30 | |
---|---|---|---|
Problema | Secventa | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 1.43 kb |
#include<stdio.h>
int main()
{
freopen("secventa.in","r",stdin);
freopen("secventa.out","w",stdout);
int n,lu,min,max,m,minf,maxf,p1,p2,i,k;
// printf(" l;kj;lkj;lkj");
scanf("%d%d",&n,&lu);
int a[lu+1];
m=2000000000;
for(i=1;i<=lu;i++)
{ scanf("%d",&a[i]); //printf("\n%d",a[i]);
if(m>a[i])
m=a[i];
}minf=m;
p1=1;
p2=lu;
//printf(" %d %d %d\n",minf,p1,p2);
for(i=1;i<=n-lu;i++)
{ m=2000000000;
for(k=2;k<=lu;k++)
{a[k-1]=a[k];
if(m>a[k-1])
m=a[k];
}
scanf("%d",&a[lu]);
if(a[lu]<m)
m=a[lu];
if(m>minf)
{
minf=m;
p1=i+1;
p2=lu+i;
// printf(" %d %d %d\n",minf,p1,p2);
}
}
printf("%d %d %d\n",p1,p2,minf);
return 0;
}