1046. Shortest Distance (20)
来源:互联网 发布:ubuntu 16.04 legacy 编辑:程序博客网 时间:2024/05/21 09:47
The task is really simple: given N exits on a highway which forms a simple cycle, you are supposed to tell the shortestdistance 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, 105]), followed by N integer distances D1 D2 ... DN, where Di is the distance between the i-th and the (i+1)-st exits, and DN 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 (<=104), 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 107.
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 931 32 54 1Sample Output:
3107
提交代码
——————————
简单题目
主要是下标有点儿混乱
#include <iostream>#include <vector>#include <algorithm>using namespace std;/* run this program using the console pauser or add your own getch, system("pause") or input loop */int N,M;int main(int argc, char** argv) {int i=0;scanf("%d",&N);vector<int> distance(N+1);vector<int> sum(N+1,0);int total=0;for(i=1; i<=N; i++){scanf("%d",&distance[i]);total+=distance[i];sum[i+1]=sum[i]+distance[i];}scanf("%d",&M);while(M--){int d1,d2;scanf("%d %d",&d1,&d2);int tmp=abs(sum[d2]-sum[d1]);int res=min(tmp,total-tmp);printf("%d\n",res);}return 0;}
- 1046. Shortest Distance (20)
- 1046. Shortest Distance (20)
- 1046. Shortest Distance (20)
- 1046. Shortest Distance (20)
- 1046. Shortest Distance (20)
- 1046. Shortest Distance (20)
- 1046. Shortest Distance (20)
- 1046. Shortest Distance (20)
- 1046. Shortest Distance (20)
- 1046. Shortest Distance (20)
- 1046. Shortest Distance (20)
- 1046. Shortest Distance (20)
- 1046. Shortest Distance (20)
- 1046. Shortest Distance (20)
- 1046. Shortest Distance (20)
- 1046. Shortest Distance (20)
- 1046. Shortest Distance (20)
- 1046. Shortest Distance (20)
- SM30 标准程序 添加事件、checkbox 等客制化需求
- DFS
- 前端界面目前所遇难点解决方案总结
- NSTimer使用和细节
- Effective C++ 改善程序与设计的55个具体做法 读书笔记
- 1046. Shortest Distance (20)
- jQuery事件绑定—on()、bind()与delegate() (赞)
- easyUI实现显示“未找到查询结果”以及在loadtable方法中传递参数
- 【tarjan模板】
- shell常用语句
- C++中的PImpl的技巧及其作用
- 【UML】UML之类图
- 排序算法
- 程序员应该避免的5种代码注释