1046 Shortest Distance (20分)

#include <iostream>
#include <cstdio>
#include <string>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <stack>
#include <queue>
#include <set>
#include <map>
using namespace std;
int n,m;
const int maxn = 100001;
int main()
{
    freopen("1.txt","r",stdin);
    int d[maxn] = {0};
    scanf("%d",&n);
    int total = 0;
    for(int i = 1;i<=n;i++)
    {
        scanf("%d",&d[i]);
        total += d[i]; //提前录入总值！！！
    }
    scanf("%d",&m);
    for(int i = 0;i<m;i++)
    {
        int s,ed,ans1=0,ans2=0,ans=0;
        scanf("%d %d",&s,&ed);
        if(s>ed)
        {
            swap(s,ed);
        }
        for(int j = s;j<ed;j++)
        {
            ans1 += d[j];
        }
        ans2 = total - ans1;
        ans = min(ans1,ans2);
        printf("%d\n",ans);
    }

    return 0;
}