A1044 Shopping in Mars (25)
来源:互联网 发布:无线信号探测软件 编辑:程序博客网 时间:2024/04/30 10: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<cstdio>int main(){int n,m,min = 0;//min记录找不到时的最小差值bool found = 0;scanf("%d %d",&n,&m);int a[n];for(int i = 0;i < n;i++)scanf("%d",&a[i]);int i = 0,j = 0,nowM = a[i];while(i<=j && j<n){if(nowM<m){//当前值偏小j++;nowM += a[j];}else if(nowM>m){//当前值偏大if(min&&nowM-m<min)//寻找最小差值min = nowM-m;if(min==0) //初始化min = nowM-m;if(i!=j){i++;nowM -= a[i-1];}else {//当前数大于mif(j<n-1)nowM = nowM - a[i] + a[j+1];i++;j++;}}else{//找到了found = 1;printf("%d-%d\n",i+1,j+1);if(j<n-1)nowM = nowM - a[i] + a[j+1];i++;j++;}}if(!found){//没找到i = 0;//重置数据j = 0;nowM = a[i];while(i<=j && j<n){if(nowM<m){//当前值偏小j++;nowM += a[j];}else {//当前值偏大if(min==nowM-m)printf("%d-%d\n",i+1,j+1);if(i!=j){i++;nowM -= a[i-1];}else {//当前数大于mif(j<n-1)nowM = nowM - a[i] + a[j+1];i++;j++;}}}}return 0;}
- A1044 Shopping in Mars (25)
- A1044. Shopping in Mars
- PAT-A1044. Shopping in Mars (25)
- pat-a1044. Shopping in Mars (25)
- PAT A1044. Shopping in Mars (25)
- PAT A1044 shopping in mars (25)
- 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)
- 使用Material Design Tint和视图详解
- 分享一套比较好看的OA后台设计模板图片
- hdu5353 Average
- hdu 5365 Run 枚举
- (4.1.1.2)菜单创建函数:onPrepareOptionsMenu 和onCreateOptionsMenu 的区别
- A1044 Shopping in Mars (25)
- Oracle CASE WHEN 用法介绍
- Word Break
- 学习设计模式——单例模式
- dfs去重(剪枝)
- Codeforces Round #284 (Div. 1) C. Array and Operations(网络流‘最大流)
- 大讲台谈hive(后篇二)
- Executor的理解与使用
- zoj 1002 Fire Net【DFS】