1046 Shortest Distance (20)

 #include<stdio.h>
 int main()
 {
    int n,m,a,b,tem,pre,p;
    int i,j;
    int ans[];
    while(scanf("%d",&n)!=EOF)
    {
        ans[]=;
        for(i=;i<=n;i++)
        {
            scanf("%d",&tem);
            ans[i]=ans[i-]+tem;
        }
        getchar();
        scanf("%d",&m);
        for(i=;i<m;i++)
        {
            getchar();
            scanf("%d %d",&a,&b);
            if(a<b)
            {
               pre=a;
               p=b;
            }
            else
            {
               p=a;
               pre=b;
            }

            int sum1=ans[p-]-ans[pre-];
            int sum2=ans[pre-]+ans[n]-ans[p-];

            printf("%d\n",sum1<sum2?sum1:sum2);
        }
    }

    return ;
 }