【C++】PAT(advanced level)1044. Shopping in Mars (25)
来源:互联网 发布:ubuntu core 教程 编辑:程序博客网 时间:2024/06/05 11:09
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:
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<stdio.h>#include<iostream>#include<algorithm>#include<string.h>#include<vector>using namespace std;int main(){int N;long long int M;//freopen("in.txt","r",stdin);vector <int> dia;while(cin>>N>>M){int n=N;while(n--){int a;//cin>>a;scanf("%d",&a);dia.push_back(a);}n=0;int m=0;long long int sum=0,min=100000000;bool flag=false;while(true){if(sum<M){sum+=dia[m];m++;}else if(sum>M){if(sum<min){min=sum;}sum-=dia[n];n++;}else {int nn=n+1;//cout<<n+1<<"-"<<m<<endl;printf("%d-%d\n",nn,m);flag=true;sum+=dia[m];m++;sum-=dia[n];n++;}if(m==N&&sum<=M){if(sum==M){cout<<n+1<<"-"<<m<<endl;flag=true;}if(flag){break;}else{M=min;n=0;m=0;sum=0;}//flag=false;}}}//fclose(stdin);return 0;}
- 【C++】PAT(advanced level)1044. Shopping in Mars (25)
- 【PAT】【Advanced Level】1044. Shopping in Mars (25)
- PAT Advanced 1044. Shopping in Mars (25)
- PAT (Advanced Level) Practise 1044 Shopping in Mars (25)
- PAT (Advanced Level) Practise 1044 Shopping in Mars (25)
- PAT (Advanced Level) 1044. Shopping in Mars (25) 找符合要求的连续子数组,贪心
- 1044. Shopping in Mars (25)【二分】——PAT (Advanced Level) Practise
- Pat(Advanced Level)Practice--1044(Shopping in Mars)
- 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甲级】1044. Shopping in Mars (25)
- JSON详解
- Linux中使用unzip命令解压缩zip文件到特定目录
- 这个团队 (一)
- HDU 1695 GCD(欧拉函数+容斥原理)
- 15. Google面试题:在一个字符串中找到第一个只出现一次的字符。如输入abaccdeff,则输出b
- 【C++】PAT(advanced level)1044. Shopping in Mars (25)
- ASP.NET的错误集
- Leetcode_Add Two Numbers
- HDU 1272 小希的迷宫(并查集:判断连通且结构为树)
- C++中实现通用数据结构(转)
- snprintf() 替代 sprintf()
- c# ConfigurationManager
- android---------ndk中的各个版本的下载地址。
- 使用顺序表完成学生信息的存储