Signals of most probably extra-terrestrial origin have been received and digitalized by The Aeronautic and Space Administration (that must be going through a defiant phase: “But I want to use feet, not meters!”). Each signal seems to come in two parts: a sequence of n integer values and a non-negative integer t. We’ll not go into details, but researchers found out that a signal encodes two integer values. These can be found as the lower and upper bound of a subrange of the sequence whose absolute value of its sum is closest to t.

You are given the sequence of n integers and the non-negative target t. You are to find a non-empty range of the sequence (i.e. a continuous subsequence) and output its lower index l and its upper index u. The absolute value of the sum of the values of the sequence from the l-th to the u-th element (inclusive) must be at least as close to t as the absolute value of the sum of any other non-empty range.
Input
The input file contains several test cases. Each test case starts with two numbers n and k. Input is terminated by n=k=0. Otherwise, 1<=n<=100000 and there follow n integers with absolute values <=10000 which constitute the sequence. Then follow k queries for this sequence. Each query is a target t with 0<=t<=1000000000.
Output
For each query output 3 numbers on a line: some closest absolute sum and the lower and upper indices of some range where this absolute sum is achieved. Possible indices start with 1 and go up to n.
Sample Input
5 1
-10 -5 0 5 10
3
10 2
-9 8 -7 6 -5 4 -3 2 -1 0
5 11
15 2
-1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1
15 100
0 0
Sample Output
5 4 4
5 2 8
9 1 1
15 1 15
15 1 15
題意：找出一段連續的序列，使得這個序列的和的絕對值和t的差值最小。輸出這段區間的絕對值和區間的左右端點。
思路：尺取的前提條件就是序列必須是單調的，否則前進和后退根本找不出規律來，就沒有辦法尺取了。但是如果堆這個數組排序的話，就不能保證這是連續的了。我們先把這段序列的前綴和數組求出來，然后將前綴和出現的序列號一同保存下來，按照由小到大排序。這樣序列就是單調的了。然后兩個指針開始尺取，如果當前區間求出的和小于t的話，說明還可以變大一點，那么就r++;如果當前區間求出的和大于t的話，說明還可以變小一點，那么就l++。注意這是前綴和，l和r不能相同。
代碼如下：

#include<iostream> #include<cstdio> #include<algorithm> #include<cmath> #include<cstring> #define ll long long #define inf 0x3f3f3f3f using namespace std;const int maxx=1e5+100; struct node{int num;int pos;bool operator<(const node &a)const{return num<a.num;} }p[maxx]; int a[maxx]; int n,m;int main() {while(~scanf("%d%d",&n,&m)&&(n+m)){p[0].num=0;p[0].pos=0;//這里需要解釋一下，因為這是前綴和，不是原來的數組，添加一個0是因為有可能從頭開始取元素，那樣的話，p[l].num需要為0才可以。for(int i=1;i<=n;i++) {scanf("%d",&a[i]);p[i].num=p[i-1].num+a[i];p[i].pos=i;}sort(p,p+1+n);//從0開始排序。while(m--){int t;scanf("%d",&t);int ans=inf,Ans;int L=0,R=0;int l=0,r=1;while(r<=n){int res=p[r].num-p[l].num;if(abs(res-t)<ans){ans=abs(res-t);Ans=res;L=p[l].pos;R=p[r].pos;}if(res<t) r++;else if(res>t) l++;else break;if(l==r) r++;}if(L>R) swap(L,R);printf("%d %d %d\n",Ans,L+1,R);}}return 0; }

尺取就是需要多思考。
努力加油a啊，(^o)/~

總結

以上是生活随笔為你收集整理的Bound Found POJ - 2566（尺取法）的全部內容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網站內容還不錯，歡迎將生活随笔推薦給好友。