Poj2566 - Bound Found（尺取临界变形）

技巧----尺取法链接

Bound Found
Time Limit: 5000MS Memory Limit: 65536K
Total Submissions: 7883 Accepted: 2570 Special Judge
Description

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
Source
Ulm Local 2001

题意分析：
简单理解就是在第一题的基础上多了一个判断的临界比较
然后用pair方便调用
1.Poj3061 - Subsequence （尺取法枚举区间）

#include<iostream>
#include<algorithm>
#include<cstring>
#define inf 0x3f3f3f3f
#define ll long long
#define maxn 100010
using namespace std;

typedef pair<ll,int> p;
ll a[maxn],t,ans,tmp,b;
int n,l,k,u,st,en;
p sum[maxn];


int main()
{
    while(cin>>n>>k&&n+k)
    {
        sum[0]=p(0,0);
        for(int i=1;i<=n;i++)
        {
            cin>>a[i];
            sum[i]=p(sum[i-1].first+a[i],i);
        }
        sort(sum,sum+1+n);
        while(k--)
        {
            cin>>t;
            tmp=inf;
            st=0,en=1;
            while(en<=n)
            {
                b=sum[en].first-sum[st].first;
                if(abs(t-b)<tmp)
                {
                    tmp=abs(t-b);
                    ans=b;
                    l=sum[st].second;
                    u=sum[en].second;
                }
                
                if(b>t) st++;
                else if(b<t) en++;
                else break;
                if(st==en) en++;

            }
            if(u<l) swap(u,l);
            cout<<ans<<" "<<l+1<<" "<<u<<endl;
        }

    }
    return 0;
}