PAT 1046 水题
水
代码:
#include <iostream>
#include <map>
#include <string.h>
#include <algorithm>
using namespace std;
const int maxn = 100005;
int N,M,D[maxn];
int main(){
memset(D, 0, sizeof(D));
cin>>N;
for(int i = 1;i <= N;i++){
int tmp = 0;
cin>>tmp;
D[i] = D[i-1] + tmp;
}
cin>>M;
for(int i = 0;i < M;i++){
int t1,t2,a,b;
cin>>t1>>t2;
a = max(t1,t2);
b = min(t1,t2);
cout<<min(D[a-1]-D[b-1],D[N]-D[a-1]+D[b-1])<<endl;
}
}
51ms