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: N (<=105), the total number of diamonds on the chain, and M (<=108), the amount that the customer has to pay. Then the next line contains N positive numbers D1 ... DN (Di<=103 for all i=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 <= j such that Di + ... + Dj = M. 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 <= j such that Di + ... + Dj > M with (Di + ... + Dj - 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 13Sample Output 1:
1-5 4-6 7-8 11-11Sample Input 2:
5 13 2 4 5 7 9Sample Output 2:
2-4 4-5
一开始很简单的遍历数列,找出最小数,结果提交以后有两个case运行超时。于是转为用二分法来求解,首先把每个位置的和都算出来,于是求位置x到y的和就转化为sum[y] - sum[x-1],然后再用二分不断搜索找到最接近M的值。代码如下:
#include <iostream>
#include <vector>
#include <cstring>
using namespace std;
int chain[100000];
int sum[100000];
int N,M,ind;
int binary(int begin,int end)
{
int left=begin,right=end,mid;
while(left<right)
{
mid=(left+right)/2;
if(sum[mid]-sum[begin-1]>=M)
right=mid;
else
left=mid+1;
}
ind=right;
return sum[right]-sum[begin-1];
}
int main(){
int i,current=0,min=999999999;
cin>>N>>M;
memset(sum,0,sizeof(sum));
for(i=1;i<=N;i++)
{
cin>>chain[i];
sum[i]=sum[i-1]+chain[i];
}
vector<vector<int> > result;
for(i=1;i<=N;i++)
{
current=binary(i,N);
if(current>=M)
{
if(current<min)
{
min=current;
result.clear();
vector<int> temp;
temp.push_back(i);
temp.push_back(ind);
result.push_back(temp);
}
else if(current==min)
{
vector<int> temp;
temp.push_back(i);
temp.push_back(ind);
result.push_back(temp);
}
}
else
break;
}
int size=result.size();
for(i=0;i<size;i++)
printf("%d-%d\n",result[i][0],result[i][1]);
}