1046 Shortest Distance (20 分)(简单模拟，前缀和)

 1 #include <algorithm>
 2 #include <iostream>
 3 #include <cstdio>
 4 #include <queue>
 5 #include <cstring>
 6 #include <vector>
 7 using namespace std;
 8 const int maxn = 0x3f3f3f3f;
 9 typedef long long ll;
10 int main() {
11     int n,m,a[100005],sum[100005],sum2 = 0;
12     cin >> n;
13     sum[0] = 0;
14     for(int i = 1; i <= n; i++) {
15         cin >> a[i];
16         if(i < n)
17         {
18             if(i == 1) sum[1] = a[1];
19             else sum[i] = sum[i-1] + a[i];
20         }
21         sum2 += a[i];
22     }
23     cin >> m;
24     int x,y,ans1,ans2;
25     while(m--) {
26     cin >> x >> y;
27         if(x < y) {
28             ans1 = sum[y-1] - sum[x-1];
29             ans2 = sum2 - ans1;
30         }
31         else{
32             ans1 = sum[x-1] - sum[y-1];
33             ans2 = sum2 - ans1;
34         }
35         cout << min(ans1,ans2) << endl;
36     }
37     return 0;
38 }