题目链接:Shortest Distance
题意:
给你N个出口,出口是环状的,告诉你出口之间的距离
最后给出任意两个出口,求最短距离
思路:
这道题我一开始用遍历的方法做,向前遍历距离,向后遍历距离
然后比较大小
这样会超时,我们在输入数据的时候就保存好每个点到起始点距离
最后查询只要O(1)的复杂度。。
但是Java
还是会卡最后一个测试点。
代码:
package adv1046;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
/**
* @author zmj
* @create 2018/11/22
*/
public class Main {
static int[] arr, dis;
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
String[] first = br.readLine().split(" ");
int N = Integer.parseInt(first[0]);
arr = new int[N+1];
dis = new int[N+1];
int sum = 0;
for (int i = 1; i <= N; i++) {
arr[i] = Integer.parseInt(first[i]);
sum += arr[i];
dis[i] = sum;
}
int M = Integer.parseInt(br.readLine());
for (int i = 0; i < M; i++) {
String[] line = br.readLine().split(" ");
int s = Integer.parseInt(line[0]);
int e = Integer.parseInt(line[1]);
if (s > e) {
int t = s;
s = e;
e = t;
}
int pre = dis[e-1] - dis[s-1];
int next = sum - dis[e-1] + dis[s-1];
System.out.println(Math.min(pre, next));
}
}
}