PAT 1033 Shopping in Mars (25)(子序列)

原创 2016年08月30日 16:40:46

题目

1044. Shopping in Mars (25)

时间限制
100 ms
内存限制
65536 kB
代码长度限制
16000 B
判题程序
Standard
作者
CHEN, Yue
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 15
3 2 1 5 4 6 8 7 16 10 15 11 9 12 14 13
Sample Output 1:
1-5
4-6
7-8
11-11
Sample Input 2:
5 13
2 4 5 7 9
Sample Output 2:
2-4
4-5

解题思路

  • 1.如果sum[i](只从开始到第i个累加和)<m,那么它的字数列也会小于,则不用考虑。
  • 2.如果sum[i](只从开始到第i个累加和)>m,那么我们循环减掉前面的,直到它等于m,你就找到答案了。
  • 3.如果找不到,可在上述第二步中记录一个最小值。

代码

#include<iostream>
#include<cstdio>
using namespace std;
int main(int argc, char *argv[])
{
    int n,m,sum[100000+5]={0},tem,first=0,mindiff = 100000000+5;
    bool isFind = false;
    scanf("%d %d",&n,&m);
    for (int i = 1; i <= n; ++i) {
        scanf("%d",&tem);
        sum[i]=sum[i-1]+tem;
        //如果``sum[i](只从开始到第i个累加和)>m``,那么我们循环减掉前面的,直到它等于`m`,你就找到答案了。
        while (sum[i] - sum[first]>m) {
            mindiff = min(mindiff,sum[i]-sum[first]);
            first++;
        }
        if (sum[i] - sum[first] == m) {
            printf("%d-%d\n",first+1,i);
            isFind = true;
        }
    }
    //如果找不到,可在上述第二步中记录一个最小值。然后再类似第二部求解。
    if (!isFind) {
        int j=0;
        for (int i = 1; i <= n; ++i) {
            while (sum[i] - sum[j]>mindiff) {
                j++;
            }
            if (sum[i] - sum[j] == mindiff) {
                printf("%d-%d\n",j+1,i);
            }
        }
    }
    return 0;
}
版权声明:本文为博主原创文章,未经博主允许不得转载。

【PAT1044】Shopping in Mars 二分法

1044. Shopping in Mars (25) 时间限制 100 ms 内存限制 32000 kB 代码长度限制 16000 B 判题程序 Standar...
  • tiantangrenjian
  • tiantangrenjian
  • 2014年02月15日 22:27
  • 1628

PAT甲级.1044. Shopping in Mars (25)

题意 Shopping in Mars is quite a different experience. The Mars people pay by chained diamonds. Each d...
  • R11happy
  • R11happy
  • 2017年02月15日 00:23
  • 230

pat1044Shopping in Mars (25)

题意分析: (1)给出一个整数序列,截取这个序列中的一段连续的子序列使得这个子序列的和等于给定的值,若不存在这样的序列,则找出序列的和大于给定值并且差值最小的。如有多个这样的序列,按照左边界的升序输出...
  • LostStephon
  • LostStephon
  • 2015年10月13日 16:33
  • 302

1044. Shopping in Mars (25)-PAT

Shopping in Mars is quite a different experience. The Mars people pay by chained diamonds. Each diam...
  • zoushidexing
  • zoushidexing
  • 2013年08月26日 22:54
  • 828

[pat]1044. Shopping in Mars (25)

https://www.patest.cn/contests/pat-a-practise/1044 题目本身不难,但是用cin,cout时一直过不了。后来受http://www.2cto.com/...
  • a_big_pig
  • a_big_pig
  • 2016年03月11日 09:42
  • 829

PAT A1044. Shopping in Mars (25)

Shopping in Mars is quite a different experience. The Mars people pay by chained diamonds. Each diam...
  • jolivan
  • jolivan
  • 2017年02月19日 20:22
  • 125

【PAT】1044. Shopping in Mars (25)

Shopping in Mars is quite a different experience. The Mars people pay by chained diamonds. Each diam...
  • realxuejin
  • realxuejin
  • 2015年10月19日 20:20
  • 195

PAT 1044 Shopping in Mars(25)

Shopping in Mars is quite a different experience. The Mars people pay by chained diamonds. Each diam...
  • persuing_truth
  • persuing_truth
  • 2017年07月28日 16:07
  • 74

PAT 1044. Shopping in Mars (25)

两个循环肯定会超时,当求出一个片段和大于或者等于
  • XUNathan
  • XUNathan
  • 2014年09月04日 20:16
  • 357

PAT A1044 shopping in mars (25)

没超时所以没用二分法 #include #include using namespace std; int main(){ int n,m,tag=0; scanf("%d%d",&n,&...
  • maotianyi941005
  • maotianyi941005
  • 2017年02月21日 15:12
  • 43
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:PAT 1033 Shopping in Mars (25)(子序列)
举报原因:
原因补充:

(最多只允许输入30个字)