PAT 甲级 1044. Shopping in Mars (25)
来源:互联网 发布:淘宝马学武白玉城真假 编辑:程序博客网 时间:2024/05/16 12:01
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 <iostream>#include <vector>using namespace std;vector<int> sum, resultArr;int n, m;void func(int i, int &j, int &tempsum) {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;tempsum = sum[j] - sum[i - 1];}int main() {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];}int minans = sum[n];for (int i = 1; i <= n; i++) {int j, tempsum;func(i, j, tempsum);if (tempsum > minans)continue;if (tempsum >= m) {if (tempsum < minans) {resultArr.clear();minans = tempsum;}resultArr.push_back(i);resultArr.push_back(j);}}for (int i = 0; i < resultArr.size(); i += 2) {printf("%d-%d\n", resultArr[i], resultArr[i + 1]);}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)
- jquery easyui combobox required=true设置
- 浅谈语音测试方案(一)
- 长沙智慧滨江项目以BIM技术打造中部地区“曼哈顿”
- Ubuntu安装Adobe flash player
- iOS 获取设备唯一标识符
- PAT 甲级 1044. Shopping in Mars (25)
- c# 选项卡
- css3 阴影、文字旋转、圆角、投影
- 智商高的人情商都低?這個人來告訴你
- python 服务器和客户端 学习http请求和响应报文头
- Neither the JAVA_HOME nor the JRE_HOME environment variable is defined
- Tween.js 中文说明文档
- shell if语句
- 如何记录和查询Redis慢执行日志