【PAT甲级】1046. Shortest Distance (20)

#include <stdio.h>#include <cstdlib>using namespace std;int main(int argc, char *argv[]) {    int n;    int i;    scanf("%d", &n);    int *a = new int[n + 1];    a[0] = 0;    for (i = 1; i <= n; i++) {        int b;        scanf("%d", &b);        a[i] = a[i - 1] + b;    }    int m;    scanf("%d", &m);    for (i = 0; i < m; i++) {        int x, y;        scanf("%d %d", &x, &y);        x--;        y--;        int p = abs(a[x] - a[y]);         int q = a[n] - p;        printf("%d\n", p < q ? p : q);    }    return 0;}