Pagini recente » Cod sursa (job #2059063) | Cod sursa (job #878413) | Cod sursa (job #23170) | Cod sursa (job #431691) | Cod sursa (job #254552)
Cod sursa(job #254552)
#include <cstdio>
#define lm 5000
int a[lm][lm], v[lm], n,m,i,j,x,y,p;
long long min;
int main()
{
freopen("cuburi2.in","r",stdin);
freopen("cuburi2.out","w",stdout);
scanf("%d %d",&n,&m);
for (i=1; i<=n; i++) scanf("%d",&v[i]);
int k;
for (j=1; j<=n; j++)
{
for (i=1; i<=n; i++)
{
k=i-j;
if (k<0) k=-k;
a[i][j]=a[i-1][j]+k*v[i];
}
}
for (i=1; i<=m; i++)
{
scanf("%d %d",&x,&y);
min=1<<62;
for (j=x; j<=y; j++)
if (a[y][j]-a[x-1][j]<min)
{
min=a[y][j]-a[x-1][j];
p=j;
}
printf("%d %lld\n",p,min);
}
fclose(stdin);
fclose(stdout);
return 0;
}