1044. Shopping in Mars

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.

段错误……不知道,不清楚……数组已经开的很大了……

#include <stdio.h>
#include <stdlib.h>
#include <vector>
using namespace std;
#define N 10001
typedef struct
{
        int start,end;
        long sum;
        }Node;
int num[N];
int n;
long cost;

int main ()
{
    scanf("%d %ld",&n,&cost);
    int i,j;
    vector<Node> equal;
    vector<Node> min;
    long now=0,minsum=100000002;
    Node temp;
    for( i=1;i<=n;i++) scanf("%d",num+i);
    for( i=1;i<=n;i++)
    {
         now+=num[i];
         j=i;
         while( now<cost&&j<n)
         {
                j++;
                now+=num[j];
                }
         temp.start=i;
         temp.end=j;
         temp.sum=now;
         if( now==cost)
         {
             equal.push_back(temp);
             }
         else if( temp.sum>cost)
         {
             if( temp.sum<minsum)
             {
                 minsum=temp.sum;
                 min.clear();
                 min.push_back(temp);
                 }
             else if( temp.sum==minsum) min.push_back(temp);

             }
         now=0;
         }
    if( equal.size()==0)
    {
        for( i=0;i<min.size();i++)
        {
             printf("%d-%d\n",min[i].start,min[i].end);
             }
        }
    else
    {
        for( i=0;i<equal.size();i++)
        {
             printf("%d-%d\n",equal[i].start,equal[i].end);
             }
        }

    system("pause");
    return 0;
    }
时间: 2024-10-31 19:00:29

1044. Shopping in Mars的相关文章

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 cu

PAT 1044. Shopping in Mars

#include <cstdio> #include <cstdlib> #include <vector> #include <climits> #include <algorithm> using namespace std; int main() { int N, M; scanf("%d%d", &N, &M); vector<int> nums(N); vector<pair<

【PAT甲级】1044 Shopping in Mars (25 分)(前缀和,双指针)

题意: 输入一个正整数N和M(N<=1e5,M<=1e8),接下来输入N个正整数(<=1e3),按照升序输出"i-j",i~j的和等于M或者是最小的大于M的数段. 代码: #define HAVE_STRUCT_TIMESPEC#include<bits/stdc++.h>using namespace std;int a[100007];int sum[100007];vector<pair<int,int> >ans;int m

pat1044. 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

Pat(Advanced Level)Practice--1044(Shopping in Mars)

Pat1044代码 题目描述: 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 diam

PAT1044. Shopping in Mars

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 take

A1044. 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 o

PAT甲级——A1044 Shopping in Mars

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 o

PAT-1044. Shopping in Mars (25)

这道题木意思是给你一个连续的序列,要求找出其中连续和为给定值的一段序列,如果不存在这样的序列,那么就输出值大于给定值且最接近的这样值的一个序列. 题目数据量是10^5,如果用N*2复杂度肯定会超时,所以我采用的是On算法.但是在求和少于给定值的过程中所需的步骤不确定.总体效果还算不错,最大时间是39ms. 自己挖了一坑... #include "stdafx.h" #include<iostream> #include<vector> using namespa