PAT甲级1044. Shopping in Mars (25)
来源:互联网 发布:淘宝网刷单平台 编辑:程序博客网 时间:2024/06/01 10:50
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 153 2 1 5 4 6 8 7 16 10 15 11 9 12 14 13Sample Output 1:
1-54-67-811-11Sample Input 2:
5 132 4 5 7 9Sample Output 2:
2-44-5
二分查找。
#include <cstdio>using namespace std;#include <vector>struct solution{int start;int end;solution(int x,int y):start(x),end(y){}};int main(){ int N,M; scanf("%d %d",&N,&M); vector<int> D(N+1,0); for(int i=1;i<=N;i++) { scanf("%d",&D[i]); D[i]+=D[i-1]; } int minPayment=(1<<30); vector<solution> S; for(int i=1;i<=N;i++){ int low=i,high=N; int mid=0; int j=0; while(low<high){ mid=(low+high)/2; if(D[mid]-D[i-1]>=M) { high=mid; } else { low=mid+1; } } j=high; int sum=D[j]-D[i-1]; if(sum>=M) { if(sum<minPayment) { minPayment=sum; S.clear(); S.push_back(solution(i,j)); } else if(sum==minPayment){ S.push_back(solution(i,j)); } } } for(int i=0;i<S.size();i++){ printf("%d-%d\n",S[i].start,S[i].end);} return 0;}
- 【PAT甲级】1044. Shopping in Mars (25)
- PAT甲级.1044. Shopping in Mars (25)
- 1044. Shopping in Mars (25) PAT 甲级
- PAT甲级1044. Shopping in Mars (25)
- PAT 甲级 1044. Shopping in Mars (25)
- PAT甲级 1044. Shopping in Mars (25)
- PAT甲级练习1044. Shopping in Mars (25)
- 1044. Shopping in Mars (25)-PAT甲级真题(二分查找)
- 1044. Shopping in Mars (25)-PAT
- PAT A 1044. Shopping in Mars (25)
- PAT 1044. Shopping in Mars (25)
- PAT 1044. Shopping in Mars (25)
- PAT 1044. Shopping in Mars (25)
- PAT 1044. Shopping in Mars (25)
- 【PAT】1044. Shopping in Mars (25)
- [pat]1044. Shopping in Mars (25)
- PAT 1044. Shopping in Mars (25)
- PAT(A) - 1044. Shopping in Mars (25)
- dl dt 和dd的用法
- iOS 应用程序生命周期
- Android中Viewpager,ScrollView嵌套ViewPager滑动冲突解决
- 面向(基于)对象编程(2nd)类与对象
- 神经网络
- PAT甲级1044. Shopping in Mars (25)
- 读书笔记 effective c++ Item 15 在资源管理类中提供对原生(raw)资源的访问
- 210
- mysql 出现 Commands out of sync; you can't run this command now
- android studio 插件大全
- SDNU-多重背包
- wpf MessageBox 消息框
- java中运算符
- 历届试题 剪格子 IDA*