Pagini recente » Cod sursa (job #1404858) | Cod sursa (job #1766757) | Cod sursa (job #2353880) | Cod sursa (job #1365935) | Cod sursa (job #254650)
Cod sursa(job #254650)
#include<stdio.h>
#include<stdlib.h>
int n,m;
int a[10001];
void solve(int x,int y)
{
int costcur=0,min=19991,pz;
for(int i=x;i<=y;i++)
{ costcur=0;
for(int j=x;j<=y;j++)
if(j!=i)
costcur=costcur+(abs(i-j)*a[j]);
if(costcur<min) {min=costcur;pz=i;}
}
printf("%d %d\n",pz,min);
}
int main()
{
freopen("cuburi2.in","r",stdin);
freopen("cuburi2.out","w",stdout);
scanf("%d %d",&n,&m);
for(int i=1;i<=n;i++)
scanf("%d",&a[i]);
int x,y;
for(int i=1;i<=m;i++)
{
scanf("%d %d",&x,&y);
solve(x,y);
}
return 0;
}