B1046 首次提交 判 段错误

1046 Shortest Distance (20 分)

The task is really simple: given N exits on a highway which forms a simple cycle, you are supposed to tell the shortest distance between any pair of exits.

Input Specification:

Each input file contains one test case. For each case, the first line contains an integer N (in [3,10​5​​]), followed by N integer distances D​1​​ D​2​​ ⋯ D​N​​, where D​i​​ is the distance between the i-th and the (i+1)-st exits, and D​N​​ is between the N-th and the 1st exits. All the numbers in a line are separated by a space. The second line gives a positive integer M (≤10​4​​), with M lines follow, each contains a pair of exit numbers, provided that the exits are numbered from 1 to N. It is guaranteed that the total round trip distance is no more than 10​7​​.

Output Specification:

For each test case, print your results in M lines, each contains the shortest distance between the corresponding given pair of exits.

Sample Input:

5 1 2 4 14 9
3
1 3
2 5
4 1

Sample Output:

3
10
7

原先代码：

#include<iostream>
using namespace std;
int main(){
	int n,c[100002],sum=0;
	scanf("%d",&n);
	for(int i=0;i<n;i++){
		scanf("%d",&c[i]);
		sum+=c[i];
	}
	int m;
	scanf("%d",&m);
	while(m--){
		int a,b,tmp=0,x=0;
		scanf("%d %d",&a,&b);
		if(a>b){
			x=a;
			a=b;
			b=x;
		}
		for(int i=a-1;i<b-1;i++){
			tmp+=c[i];
		}
		if(tmp>sum-tmp){
			printf("%d\n",sum-tmp);
		}
		else{
			printf("%d\n",tmp);
		}
	}
	return 0;
}

真实原因：超时 

通过的代码：

 

#include<iostream>
using namespace std;
int main(){
	int n,c[100002],dis[100002],sum=0;
	dis[0]=0;
	scanf("%d",&n);
	for(int i=1;i<=n;i++){
		scanf("%d",&c[i]);
		sum+=c[i];
		dis[i]=dis[i-1]+c[i];
	}
	int m;
	scanf("%d",&m);
	while(m--){
		int a,b,tmp=0,x=0;
		scanf("%d %d",&a,&b);
		if(a>b){
			x=a;
			a=b;
			b=x;
		}
		if(sum-(dis[b-1]-dis[a-1])>dis[b-1]-dis[a-1]){
			printf("%d\n",dis[b-1]-dis[a-1]);
		}
		else{
			printf("%d\n",sum-(dis[b-1]-dis[a-1]));
		}
	}
	return 0;
}