题目

Shopping in Mars is quite a diferent 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 of the chain one by one. Once a diamond is of the chain, it cannot be taken back. For example, if we have a chain of 8 diamonds with values M3, 2, 1, 5, 4, 6, 8, 7, and we must pay M15. We may have 3 options:

  1. Cut the chain between 4 and 6, and take of the diamonds from the position 1 to 5 (with values

    3+2+1+5+4=15).
  2. Cut before 5 or afer 6, and take of the diamonds from the position 4 to 6 (with values 5+4+6=15).
  3. Cut before 8, and take of 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 suficient 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

题目分析

已知一系列数S,已知一个整数N,一次从S中只能切分一次,切分之后可以从切分后的任意一边弹出M个数字,使得这M个数字之和>=M并且是最小值nearM,求出所有切分后可以弹出M个数字之和==nearM的情况,打印("切分位置-最后一个弹出数字的位置"(从左往右弹出)或者"最后一个弹出数字的位置-切分位置"(从右往左弹出))

解题思路

思路 01(最优)

  1. minans记录大于M的最小值,如果当前找到的tempnum>=M的最小值小于minans,清空之前记录的信息,因为找到了更小的情况
  2. 将所有情况记录在vector中最后打印

思路 02

  1. 二分查找到nearM>M的最小值(第一个大于M的数字的下标j,可能情况:s[j-1]-s[i-1]M(nearMM) 或者 s[j-1]-s[i-1]<M&&s[j]-s[i-1]>M(nearM==s[j]-s[i-1]))
  2. 二分查找到s[j-1]-s[i-1]==nearM的所有情况

Code

Code 01

#include <iostream>
#include <vector>
using namespace std;
int N,M;
vector<int> sum;
vector<int> res;
void find(int i,int& j,int& tempnum) {
int left =i,right=N;
while(left<right) {
int mid=(left+right)/2;
if(sum[mid]-sum[i-1]>=M) {
right = mid;
} else {
left = mid+1;
}
}
j = right; //此时left==right
tempnum=sum[j]-sum[i-1];
}
int main(int argc,char * argv[]) {
// 1 输入
scanf("%d%d",&N,&M);
// int sum[N+1]= {0};
sum.resize(N+1);
for(int i=1; i<=N; i++) {
scanf("%d",&sum[i]);
sum[i]+=sum[i-1];
}
// 2 查找切分点
int minans=sum[N]; //最小结果:若有等于M的minans=M,若没有等于M的取最小大于M的数作为minans的值
for(int i=1; i<=N; i++) {
int j,tempnum;
find(i,j,tempnum); // 二分查找 找到>=M的第一个数 tempnum
if(tempnum>minans) continue; //若tempnum比之前找到的最小值大,跳过不考虑
if(tempnum>=M) { //如果tempnum<=之前找到的最小值,并且>=M
if(tempnum<minans) { //如果小于 minans,替换
res.clear();
minans=tempnum;
}
// 如果 tempnum==minans(1 tempnum等于当前大于M的最小值 2 tempnum==M)
res.push_back(i);
res.push_back(j);
}
}
for(int i=0; i<res.size(); i+=2) {
printf("%d-%d\n",res[i],res[i+1]);
}
return 0;
}

Code 02

#include <iostream>
#include <vector>
using namespace std;
vector<int> sum;
int N,M,nearM=100010;
int up_bound(int left,int right,int x) {
while(left<right) {
int m=left+((right-left)>>1);
if(sum[m]>x) {
right=m;
} else {
left=m+1;
}
}
return left;
}
int main(int argc, char * argv[]) { // 1 输入
scanf("%d%d",&N,&M);
sum.resize(N+1);
for(int i=1; i<=N; i++) {
scanf("%d",&sum[i]);
sum[i]+=sum[i-1];
} // 2 二分查找>=M的最小值
for(int i=1; i<=N; i++) {
int j = up_bound(i,N+1,sum[i-1]+M);
if(sum[j-1]-sum[i-1]==M) {
nearM=M;
break;
} else if(j<=N&&sum[j]-sum[i-1]<nearM) {
nearM=sum[j]-sum[i-1];
}
} for(int i=1; i<=N; i++) {
int j = up_bound(i,N+1,sum[i-1]+nearM);
if(sum[j-1]-sum[i-1]==nearM) {
printf("%d-%d\n",i,j-1);
}
}
return 0;
}

PAT Advanced 1044 Shopping in Mars (25) [⼆分查找]的更多相关文章

  1. PAT 甲级 1044 Shopping in Mars (25 分)(滑动窗口,尺取法,也可二分)

    1044 Shopping in Mars (25 分)   Shopping in Mars is quite a different experience. The Mars people pay ...

  2. 1044 Shopping in Mars (25分)(二分查找)

    Shopping in Mars is quite a different experience. The Mars people pay by chained diamonds. Each diam ...

  3. 1044 Shopping in Mars (25 分)

    Shopping in Mars is quite a different experience. The Mars people pay by chained diamonds. Each diam ...

  4. 【PAT甲级】1044 Shopping in Mars (25 分)(前缀和,双指针)

    题意: 输入一个正整数N和M(N<=1e5,M<=1e8),接下来输入N个正整数(<=1e3),按照升序输出"i-j",i~j的和等于M或者是最小的大于M的数段. ...

  5. PAT 甲级 1044 Shopping in Mars

    https://pintia.cn/problem-sets/994805342720868352/problems/994805439202443264 Shopping in Mars is qu ...

  6. PAT (Advanced Level) 1044. Shopping in Mars (25)

    双指针. #include<cstdio> #include<cstring> #include<cmath> #include<vector> #in ...

  7. PAT甲题题解-1044. Shopping in Mars (25)-水题

    n,m然后给出n个数让你求所有存在的区间[l,r],使得a[l]~a[r]的和为m并且按l的大小顺序输出对应区间.如果不存在和为m的区间段,则输出a[l]~a[r]-m最小的区间段方案. 如果两层fo ...

  8. PAT Advanced 1027 Colors in Mars (20 分)

    People in Mars represent the colors in their computers in a similar way as the Earth people. That is ...

  9. 1044. Shopping in Mars (25)

    分析: 考察二分,简单模拟会超时,优化后时间正好,但二分速度快些,注意以下几点: (1):如果一个序列D1 ... Dn,如果我们计算Di到Dj的和, 那么我们可以计算D1到Dj的和sum1,D1到D ...

随机推荐

  1. 八十八、SAP中ALV事件之二,事件的定义和事件子例程

    一.我们来到SE37,找到REUSE_ALV_EVENTS_GET相关的定义 二.我们需要用到下面这3个事件 三.我们添加一个第五步,并把显示ALV座位第六步.在第五步中定义三个事件 四.在末尾,添加 ...

  2. net GC 学习以及问题

    引用对象必要空间开销:对象指针.同步块索引 GC重要点: 每个应用程序包含一组根,每个根都是一个存储位置,其中包含指向引用类型对象的一个指针,该指针要么指向托管堆中的要给对象,要么为null.(这句话 ...

  3. tomcat和servlet容器的关系

  4. Spring 控制反转容器(Inversion of Control – IOC)

    系列教程 Spring 框架介绍 Spring 框架模块 Spring开发环境搭建(Eclipse) 创建一个简单的Spring应用 Spring 控制反转容器(Inversion of Contro ...

  5. 第二十篇ORM查询与SQL语句

    ORM查询与SQL语句 多表操作 创建模型 实例:我们来假定下面这些概念,字段和关系 作者模型:一个作者有姓名和年龄. 作者详细模型:把作者的详情放到详情表,包含生日,手机号,家庭住址等信息.作者详情 ...

  6. P 1028 人口普查

    转跳点:

  7. 微信公众号开发之内网映射外网natapp安装(一)

    一,为什么使用natapp 1,在进行微信公众号开发时,我们需要搭建网站,并且随时都有可能修改网站内容进行调试.如果能够将内网ip映射到外网上,将大大方便我们的调试.每次发布只需eclipse运行应用 ...

  8. 4 react 简书 引入 redux 的 combineReducers 对 redux 数据进行管理

    1. src 下的 common 下的 header 创建 store 文件夹 下创建 reducer.js # src/common/header/store/reducer.js const st ...

  9. Codeforces 437D 贪心+并查集

    这个题目让我想起了上次在湘潭赛的那道跪死了的题.也是最值问题,这个也是,有n个动物园 每个都有权值 然后被m条路径相连接,保证图是连通的,然后求所有的p[i][j]之和.i,j为任意两个zoo,pij ...

  10. RGB转到HSV色彩空间转换

    原文链接:https://blog.csdn.net/lsg19920625/article/details/78416649