pat 1044
来源:互联网 发布:雅士尼处理器软件 编辑:程序博客网 时间:2024/05/18 05:59
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 <string.h>int chainValue[100010], ans[100010][2];int n, m, cnt = 0, start, end, mmin = 0x6fffffff;bool flag;void dfs(int t, int sum){if(sum <= 0 || t > n){end = t - 1;if(sum < 0){sum = -sum;if(sum < mmin){mmin = sum;ans[cnt][0] = start;ans[cnt][1] = end;}else if(sum == mmin){cnt++;ans[cnt][0] = start;ans[cnt][1] = end;}}else if(sum == 0){flag = true;mmin = 0;cnt++;printf("%d-%d\n", start, end);}return;}if(sum > 0)sum -= chainValue[t];dfs(t+1, sum);}int main(){int i, j;while(scanf("%d%d", &n, &m) != EOF){for(i = 1; i <= n; i++)scanf("%d", &chainValue[i]);flag = false;for(i = 1; i <= n; i++){start = i;dfs(i, m);}if(!flag){for(i = 0; i <= cnt; i++)printf("%d-%d\n", ans[i][0], ans[i][1]);}}return 0;}
- pat 1044
- pat 1044
- pat 1044
- PAT 1044
- pat advanced 1044
- PAT(甲级)1044
- *浙大PAT甲级 1044
- PAT乙级1044
- PAT甲级1044
- pat-bl-1044
- PAT 1044火星数字
- PAT basic 1044
- PAT甲级 1044
- pat甲级1044
- pat
- 【PAT】
- PAT
- PAT
- OllyDBG 入门系列(五)-消息断点及 RUN 跟踪
- 支持向量机的发展
- 图的邻接表表示
- 307 - Sticks
- ZOJ 2112 Dynamic Rankings(Treap套在线段树上...)
- pat 1044
- ZOJ 2974 Just Pour the Water(矩阵快速幂)
- 第二周作业
- MFC用ofstream输出CString型到文件
- window.location.assign(url)和replace(url)区别
- WinHTK开发与使用
- HTTP协议详解
- 根文件系统init进程分析
- VPN连接后不能上网的解决方法