hlg1398邮局问题【找中位数】

最新推荐文章于 2018-03-29 21:12:38 发布

zhanzhaozhangxiaoyi

最新推荐文章于 2018-03-29 21:12:38 发布

阅读量323

点赞数

本文链接：https://blog.csdn.net/zhanzhaozhangxiaoyi/article/details/45272467

版权

水题直接上代码：

 1 #include <iostream>
 2 #include <cstdio>
 3 #include <cstring>
 4 #include <cmath>
 5 using namespace std;
 6 
 7 const int maxn = 1005;
 8 int a[maxn];
 9 
10 int main() {
11     int n, m;
12     int x, y;
13     while(EOF != scanf("%d",&n) ) {
14         for(int i = 1; i <= n; i++) {
15             scanf("%d",&a[i]);
16         }
17         scanf("%d",&m);
18         while(m--) {
19             scanf("%d %d",&x, &y);
20             int pos = ( x + y ) / 2;
21             long long sum = 0;
22             for(int i = x; i <= y; i++) {
23                 sum += (long long) ( fabs(a[pos] - a[i]) );
24             }
25             printf("%lld\n", sum);
26         }
27     }
28     return 0;
29 }