Pagini recente » Cod sursa (job #1701951) | Cod sursa (job #340369) | Cod sursa (job #295185) | Cod sursa (job #1014229) | Cod sursa (job #1412965)
#include <cstdio>
int n,m,k,i,j,x,y,a[250005],pozmin;
long long sum,minim;
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",&a[i]);
for (k=1; k<=m; k++)
{
scanf("%d%d",&x,&y);
minim=250005000000;
pozmin=-1;
for (i=x; i<=y; i++)
{
sum=0;
for (j=i-1; j>=x; j--)
sum=sum+a[j]*(i-j);
for (j=i+1; j<=y; j++)
sum=sum+a[j]*(j-i);
if (sum<minim)
{
minim=sum;
pozmin=i;
}
}
printf("%d %d\n",pozmin,minim);
}
return 0;
}