1044 Shopping in Mars （25 分）二分查找

1044 Shopping in Mars （25 分）

Shopping in Mars is quite a different experience. The Mars people pay by chained diamonds. Each diamond has a value (in Mars dollars M$). When making the payment, the chain can be cut at any position for only once and some of the diamonds are taken off the chain one by one. Once a diamond is off the chain, it cannot be taken back. For example, if we have a chain of 8 diamonds with values M$3, 2, 1, 5, 4, 6, 8, 7, and we must pay M$15. We may have 3 options:

1. Cut the chain between 4 and 6, and take off the diamonds from the position 1 to 5 (with values 3+2+1+5+4=15).
2. Cut before 5 or after 6, and take off the diamonds from the position 4 to 6 (with values 5+4+6=15).
3. Cut before 8, and take off the diamonds from the position 7 to 8 (with values 8+7=15).

Now given the chain of diamond values and the amount that a customer has to pay, you are supposed to list all the paying options for the customer.

If it is impossible to pay the exact amount, you must suggest solutions with minimum lost.

Input Specification:

Each input file contains one test case. For each case, the first line contains 2 numbers: NNN (≤105le 10^5≤10​5​​), the total number of diamonds on the chain, and MMM (≤108le 10^8≤10​8​​), the amount that the customer has to pay. Then the next line contains NNN positive numbers D1⋯DND_1 cdots D_ND​1​​⋯D​N​​ (Di≤103D_ile 10^3D​i​​≤10​3​​ for all i=1,⋯,Ni=1, cdots , Ni=1,⋯,N) which are the values of the diamonds. All the numbers in a line are separated by a space.

Output Specification:

For each test case, print i-j in a line for each pair of i ≤le≤ j such that DDDi + ... + DDDj = MMM. Note that if there are more than one solution, all the solutions must be printed in increasing order of i.

If there is no solution, output i-j for pairs of i ≤le≤ j such that DDDi + ... + DDDj >M> M>M with (DDDi + ... + DDDj −M- M−M) minimized. Again all the solutions must be printed in increasing order of i.

It is guaranteed that the total value of diamonds is sufficient to pay the given amount.

Sample Input 1:

16 15
3 2 1 5 4 6 8 7 16 10 15 11 9 12 14 13

Sample Output 1:

1-5
4-6
7-8
11-11

Sample Input 2:

5 13
2 4 5 7 9

Sample Output 2:

2-4
4-5
思路：
　　枚举左端点，二分查找

#include<iostream>
#include<string>
#include<vector>
#include<string>
#include<cstdio>
#include<cmath>
#include<string.h>
#include<algorithm>
using namespace std;

vector<int>result;

int binarySearch(int low,int high,int sum[],int m)
{
    int ans=0,left=low,mid;
    while(left<=high)
    {
        mid=left+(high-left)/2;
        if(sum[mid]-sum[low-1]>=m)
        {
            ans=mid;
            high=mid-1;
        }
        else
        {
            left=mid+1;
        }
    }
    return ans;
}


int main()
{
    int n,m;
    scanf("%d%d",&n,&m);
    int a[n+1],sum[n+1];
    sum[0]=0;
    for(int i=1; i<n+1; i++)
    {
        scanf("%d",&a[i]);
        sum[i]=a[i]+sum[i-1];
    }
    int minV=m+1000000;
    vector<int>result;
    for(int i=1; i<n+1; i++)
    {
        int rindex=binarySearch(i,n,sum,m);
        if(rindex<i)
            continue;
        int temp=sum[rindex]-sum[i-1];
       // printf("%d
",temp);
        if(temp<minV)
        {
            minV=temp;
            result.clear();
        }
        if(temp==minV)
        {
            result.push_back(i);
            result.push_back(rindex);
        }
    }
    for(int i=0; i<result.size(); i+=2)
    {
        printf("%d-%d
",result[i],result[i+1]);
    }
    return 0;
}