1046 Shortest Distance （20 point(s)）

#include<iostream> #include<cstdio> #include<algorithm> using namespace std; const int MAXN = 1e5 + 10; int sum[MAXN]; int n, x; int main() { scanf("%d", &n); for(int i = 1; i <= n; ++i) scanf("%d"

>>阅读原文<<