這道題雖然也是一道模擬題，但是直接模擬，第三個(gè)測(cè)試點(diǎn)超時(shí)了...
這道題還是需要一點(diǎn)技巧的。

#include<iostream>
using namespace std;
const int maxn = 100010;
int a[maxn] = { 0 };
int main() {
    int n, dis, m, st, ed;
    int sum = 0;
    scanf("%d", &n);
    for (int i = 1; i <= n; i++) {
        scanf("%d", &dis);
        sum += dis;
        a[i] = sum;
    }
    scanf("%d", &m);
    for (int i = 0; i < m; i++) {
        scanf("%d %d", &st, &ed);
        if (st > ed) {
            swap(st, ed);
        }
        int ans1 = a[ed - 1] - a[st - 1];
        int ans2 = sum - ans1;
        printf("%d\n", ans1 < ans2 ? ans1 : ans2);
    }
    return 0;
}