POJ 2566 尺取法（进阶题）

 1 #include "stdio.h"
 2 #include "stdlib.h"
 3 #include "iostream"
 4 #include "algorithm"
 5 #include "string"
 6 #include "cstring"
 7 #include "queue"
 8 #include "cmath"
 9 #include "vector"
10 #include "map"
11 #include "set"
12 #define db double
13 #define inf 0x3f3f3f
14 #define mj
15 //#define ll long long
16 #define unsigned long long ull;
17 using namespace std;
18 const int mod = 1000000007;
19 const int N=1e6+5;
20 const double eps = 1e-10;
21 typedef pair<int, int > pii;
22 pii p[N];
23 int n, m, k;
24 void f(int k)
25 {
26     int l = 0, r = 1, ll, rr, v, mi = inf;
27     while (l<=n&&r<=n&&mi!=0)
28     {
29         int tmp=p[r].first - p[l].first;
30         if (abs(tmp - k) < mi)
31         {
32             mi = abs(tmp - k);
33             rr = p[r].second;
34             ll = p[l].second;
35             v = tmp;
36         }
37         if (tmp> k)
38             l++;
39         else if (tmp < k)
40             r++;
41         else
42             break;
43         if (r == l)
44             r++;
45     }
46     if(ll>rr) swap(ll,rr);//因为ll和rr大小没有必然关系（）取绝对值，所以//要交换
47     printf("%d %d %d\n", v, ll+1, rr);
48 }
49 int main()
50 {
51     while (scanf("%d %d", &n, &m)==2,n||m)
52     {
53         p[0]=make_pair(0, 0);
54         for (int i = 1; i <= n; i++)
55         {
56             scanf("%d", &p[i].first);
57             p[i].first += p[i - 1].first;
58             p[i].second = i;
59         }
60         sort(p, p + n + 1);
61         while (m--)
62         {
63             scanf("%d", &k);
64             f(k);
65         }
66     }
67     return 0;
68 }