PATA1046题解

//
//  main.cpp
//  PATA1046
//
//  Created by Phoenix on 2018/2/12.
//  Copyright © 2018年 Phoenix. All rights reserved.
//

#include <iostream>
#include <cstdio>
#include <algorithm>
using namespace std;
const int maxn = 100010;
int d[maxn], ans[maxn] = {0};

int main(int argc, const char * argv[]) {
    int n;
    scanf("%d", &n);
    for(int i = 1; i <= n; i++) {
        scanf("%d", &d[i]);
        ans[i] = ans[i - 1] + d[i];
    }
    int sum = ans[n];
    int m;
    scanf("%d", &m);
    for(int i = 0; i < m; i++) {
        int a, b;
        scanf("%d %d", &a, &b);
        if(b < a) swap(a, b);
        int dis = ans[b - 1] - ans[a - 1];
        printf("%d\n", min(dis, sum - dis));
    }
    return 0;
}