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:
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).
Cut before 5 or after 6, and take off the diamonds from the position 4 to 6 (with values 5+4+6=15).
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:
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 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
Note1
- 题意, 切一段珠子cover掉账单
- 思路: 双指针,想用二分然而并没有找到机会, 导致自己的代码有两个点超时
Code1
#include<iostream>
#include<algorithm>
using namespace std;
struct result{
int start;
int end;
}results[100010];
bool cmp(result a, result b){
return a.start < b.start;
}
int main(){
int num, target, min = 10010000, a[100010];
int cnt = 0;
cin >> num >> target;
for(int i = 1; i <= num; i++){
cin >> a[i];
}
for(int i = 1; i <= num; i++){
int sum = 0;
for(int j = i; j <= num; j++){
sum += a[j];
if(sum - target>= 0 && sum - target < min){
cnt = 0;
min = sum - target;
results[cnt].start = i;
results[cnt++].end = j;
}
else if(sum - target == min){
results[cnt].start = i;
results[cnt++].end = j;
}
else if(sum - target > min) break;
}
}
sort(results, results + cnt, cmp);
for(int i = 0; i < cnt; i++) cout << results[i].start << "-" << results[i].end << endl;
return 0;
}
Note2
数组开的太小,导致查了好久
#include<iostream>
#include<algorithm>
using namespace std;
const int maxn = 1e6;
int sum[maxn] = {0};
int num, target;
struct result{
int start;
int end;
}results[maxn];
int lowerbound(int i){
int left = i, right = num;
while(left < right){
int mid = left + (right - left) / 2;
if(sum[mid] - sum[i - 1] >= target) right = mid;
else left = mid + 1;
}
return left;
}
int main(){
int min = maxn;
int cnt = 0;
cin >> num >> target;
for(int i = 1; i <= num; i++){
cin >> sum[i];
sum[i] += sum[i-1];
}
min = sum[num];
for(int i = 1; i <= num; i++){
int j, tempsum;
j = lowerbound(i);
tempsum = sum[j] - sum[i - 1];
if(tempsum > min) continue;
if(tempsum >= target){
if(tempsum < min){ cnt = 0; min = tempsum;}
results[cnt].start = i;
results[cnt++].end = j;
}
}
// sort(results, results + cnt, cmp);
for(int i = 0; i < cnt; i++) cout << results[i].start << "-" << results[i].end << endl;
return 0;
}