PAT (Advanced Level) Practise 1044 Shopping in Mars (25)

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 (<=10⁵), the total number of diamonds on the chain, and M (<=10⁸), the amount that the customer has to pay. Then the next line contains N positive numbers D₁ ... D_N (D_i<=10³ 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 D_i + ... + D_j = 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 D_i + ... + D_j > M with (D_i + ... + D_j - 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

题意：有n颗钻石，每颗钻石都有价值。一共有m的钱，要你找出一些连续的钻石，使得它们的价值等于m。若找不到，则找到连续的钻石使得它们的价值和为大于m的最小值。输出可以有哪些连续序列

解题思路：先求出前缀和，然后可以用尺取法求

#include <iostream>
#include <cstdio>
#include <cmath>
#include <cstring>
#include <algorithm>
#include <stack>
#include <queue>
#include <vector>
#include <map>

using namespace std;

#define ll long long
int n,m,ans;
int sum[100090];
int a[100009];

int main()
{
    scanf("%d %d",&n,&m);
    memset(sum,0,sizeof sum);
    for(int i=1;i<=n;i++)
        scanf("%d",&a[i]),sum[i]=sum[i-1]+a[i];
    ans=sum[n];
    for(int i=1,j=1;i<=n;i++)
    {
        while(sum[j]-sum[i-1]<m&&j<=n) j++;
        if(sum[j]-sum[i-1]>=m) ans=min(sum[j]-sum[i-1],ans);
    }
    for(int i=1,j=1;i<=n;i++)
    {
        while(sum[j]-sum[i-1]<ans&&j<=n) j++;
        if(sum[j]-sum[i-1]==ans) printf("%d-%d\n",i,j);
    }
    return 0;
}