1044 Shopping in Mars （25 分）

最新推荐文章于 2021-11-24 16:49:41 发布

weixin_30469895

最新推荐文章于 2021-11-24 16:49:41 发布

阅读量90

点赞数

原文链接：http://www.cnblogs.com/Mered1th/p/10438988.html

版权

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:

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:

Each input file contains one test case. For each case, the first line contains 2 numbers:

Output Specification:

For each test case, print i-j in a line for each pair of i

If there is no solution, output i-j for pairs 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


分析：一开始直接模拟发现测试点2和5超时了，解决办法：sum是严格递增的，所以可以用二分来加速。。不过这题的二分好难写，注意下标位置

原始代码：

 1 /**
 2 * Copyright(c)
 3 * All rights reserved.
 4 * Author : Mered1th
 5 * Date : 2019-02-26-15.17.46
 6 * Description : A1044
 7 */
 8 #include<cstdio>
 9 #include<cstring>
10 #include<iostream>
11 #include<cmath>
12 #include<algorithm>
13 #include<string>
14 #include<unordered_set>
15 #include<map>
16 #include<vector>
17 #include<set>
18 using namespace std;
19 const int INF=1000000010;
20 const int maxn=100010;
21 int a[maxn];
22 int n,S,nearS=INF;
23 struct Node{
24     int l,r;
25 };
26 vector<Node> ans;
27 int main(){
28 #ifdef ONLINE_JUDGE
29 #else
30     freopen("1.txt", "r", stdin);
31 #endif
32     int n,m;
33     scanf("%d%d",&n,&m);
34     for(int i=1;i<=n;i++){
35         scanf("%d",&a[i]);
36     }
37     int sum,i,j;
38     for(i=1;i<=n;i++){
39         sum=0;
40         for(j=i;j<=n;j++){
41             sum+=a[j];
42             if(sum>=m){
43                 if(nearS>sum){
44                     ans.clear();
45                     nearS=sum;
46                     ans.push_back(Node{i,j});
47                 }
48                 else if(nearS==sum){
49                     ans.push_back(Node{i,j});
50                 }
51                 break;
52             }
53         }
54     }
55     for(int i=0;i<ans.size();i++){
56         printf("%d-%d\n",ans[i].l,ans[i].r);
57     }
58     return 0;
59 }

二分：

 1 /**
 2 * Copyright(c)
 3 * All rights reserved.
 4 * Author : Mered1th
 5 * Date : 2019-02-26-15.17.46
 6 * Description : A1044
 7 */
 8 #include<cstdio>
 9 #include<cstring>
10 #include<iostream>
11 #include<cmath>
12 #include<algorithm>
13 #include<string>
14 #include<unordered_set>
15 #include<map>
16 #include<vector>
17 #include<set>
18 using namespace std;
19 const int INF=1000000010;
20 const int maxn=100010;
21 int sum[maxn],nearS=INF;
22 int main(){
23 #ifdef ONLINE_JUDGE
24 #else
25     freopen("1.txt", "r", stdin);
26 #endif
27     int n,m;
28     scanf("%d%d",&n,&m);
29     sum[0]=0;
30     for(int i=1;i<=n;i++){
31         scanf("%d",&sum[i]);
32         sum[i]+=sum[i-1];
33     }
34     for(int i=1;i<=n;i++){
35         int j=upper_bound(sum+i,sum+n+1,sum[i-1]+m)-sum;
36         if(sum[j-1]-sum[i-1]==m){
37             nearS=m;
38             break;
39         }
40         else if(j<=n &&sum[j]-sum[i-1]<nearS){
41             nearS=sum[j]-sum[i-1];
42         }
43     }
44     for(int i=1;i<=n;i++){
45         int j=upper_bound(sum+i,sum+n+1,sum[i-1]+nearS)-sum;
46         if(sum[j-1]-sum[i-1]==nearS){
47             printf("%d-%d\n",i,j-1);
48         }
49     }
50     return 0;
51 }

自定义二分。。

 1 /**
 2 * Copyright(c)
 3 * All rights reserved.
 4 * Author : Mered1th
 5 * Date : 2019-02-26-15.17.46
 6 * Description : A1044
 7 */
 8 #include<cstdio>
 9 #include<cstring>
10 #include<iostream>
11 #include<cmath>
12 #include<algorithm>
13 #include<string>
14 #include<unordered_set>
15 #include<map>
16 #include<vector>
17 #include<set>
18 using namespace std;
19 const int INF=1000000010;
20 const int maxn=100010;
21 int sum[maxn],nearS=INF;
22 int main(){
23 #ifdef ONLINE_JUDGE
24 #else
25     freopen("1.txt", "r", stdin);
26 #endif
27     int n,m;
28     scanf("%d%d",&n,&m);
29     sum[0]=0;
30     for(int i=1;i<=n;i++){
31         scanf("%d",&sum[i]);
32         sum[i]+=sum[i-1];
33     }
34     for(int i=1;i<=n;i++){
35         int j=upper_bound(sum+i,sum+n+1,sum[i-1]+m)-sum;
36         if(sum[j-1]-sum[i-1]==m){
37             nearS=m;
38             break;
39         }
40         else if(j<=n &&sum[j]-sum[i-1]<nearS){
41             nearS=sum[j]-sum[i-1];
42         }
43     }
44     for(int i=1;i<=n;i++){
45         int j=upper_bound(sum+i,sum+n+1,sum[i-1]+nearS)-sum;
46         if(sum[j-1]-sum[i-1]==nearS){
47             printf("%d-%d\n",i,j-1);
48         }
49     }
50     return 0;
51 }