1046. Shortest Distance (20) 坑我

不能一个个加起来，不然测试点2超时

#define  _CRT_SECURE_NO_WARNINGS 

#include<string>
#include<string.h>
#include<vector>
#include<map>
#include<stack>
#include<iostream> 
#include<algorithm>
#include<stdio.h> 
using namespace std; 
 
int main()
{
int N;
cin >> N;
int *dis = new int[N]; 
memset(dis,0,sizeof(int)*N); 
int sum = 0;
for (int i = 0; i < N; i++)
{
int itmp;
scanf("%d", &itmp);
sum += itmp;
if (i != N - 1)
dis[i + 1] = dis[i] + itmp;
}
int num;
cin >> num;
for (int i = 0; i < num; i++)
{
int a, b;
scanf("%d %d",&a,&b);
 
int out;
if (a < b)
out = dis[b - 1] - dis[a - 1];
else
out = dis[a - 1] - dis[b - 1];
int ttt = sum - out;
if (ttt>out)
cout << out << endl;
else
cout << ttt << endl;
}
return 0;
}