1044. Shopping in Mars (25)
来源:互联网 发布:发哥 知乎 编辑:程序博客网 时间:2024/06/05 19:53
Shopping in Mars is quite a different experience. The Mars people pay by chained diamonds. Each diamond has a value (in Mars dollars M
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>#include<cstdio>using namespace std;int sum[100005];int min1=10000000;vector <int> v;int n,m;int f(int i){ int left,right,mid; left=i;right=n; while(left<right) { mid=(left+right)/2; if (sum[mid]-sum[i-1]>=m) right=mid; else left=mid+1; } return right;}int main(){ cin>>n>>m; for (int i=1;i<=n;i++) { cin>>sum[i]; sum[i]+=sum[i-1]; } for (int i=1;i<=n;i++) { int j=f(i); int t=sum[j]-sum[i-1]-m; if (t>min1) continue; if (t>=0) { if (t<min1) { min1=t; v.clear(); } v.push_back(i); v.push_back(j); } } for (int i=0;i<v.size();i+=2) printf("%d-%d\n",v[i],v[i+1]); return 0;}
- 1044. Shopping in Mars (25)
- 1044. Shopping in Mars (25)
- 1044. Shopping in Mars (25)
- 1044. Shopping in Mars (25)
- 1044. Shopping in Mars (25)
- 1044. Shopping in Mars (25)
- 1044. Shopping in Mars (25)
- 1044. Shopping in Mars (25)
- 1044. Shopping in Mars (25)
- 1044. Shopping in Mars (25)
- 1044. Shopping in Mars (25)
- 1044. Shopping in Mars (25)
- 1044. Shopping in Mars (25)
- 1044. Shopping in Mars (25)
- 1044. Shopping in Mars (25)
- 1044. Shopping in Mars (25)
- 1044. Shopping in Mars (25)
- 1044. Shopping in Mars (25)
- Java中的第一个程序
- 在安卓上运行TensorFlow
- POJ 2763 Housewife Wind (LCA+线段树)
- CentOS 上 Jenkins 安装
- JSP 测试使用 Junit 比较方便
- 1044. Shopping in Mars (25)
- 153. Find Minimum in Rotated Sorted Array--在旋转数组中找最小值
- Android学习之使用seekbar进行歌曲的同步
- gitlab一键安装
- 简单的CSS动画加JS实现转盘
- Python学习笔记——Property用法
- STP个人理解
- HttpsURLConnection发送get型式参数
- Android App整体架构设计的思考