1046. Shortest Distance (20)

1046. Shortest Distance (20)

#include<stdio.h>
#include<malloc.h>
#include<math.h>
int main()
{
    int n,m,i,temp;
    int *dis,sum=0;
    scanf("%d",&n);
    dis=(int *)malloc((n+1)*sizeof(int));
    for(i=1;i<=n;i++)
    {
        dis[i]=sum;
        scanf("%d",&temp);
        sum+=temp;
    }
    scanf("%d",&m);
    for(i=0;i<m;i++)
    {
        int start,end;
        scanf("%d %d",&start,&end);
        if(start>end)
        {
            int t=start;
            start=end;end=t;
        }
        int shortdis=dis[end]-dis[start];
        shortdis=shortdis<(sum-shortdis)?shortdis:(sum-shortdis);
        printf("%d\n",shortdis);
    }
}

转载于:https://www.cnblogs.com/xLester/p/7570495.html