点击链接PAT甲级-AC全解汇总
题目:
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:
- 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).
- Cut before 5 or after 6, and take off the diamonds from the position 4 to 6 (with values 5+4+6=15).
- 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
题意:
输入N,M
再输入N个数
找出所有第 i 到第 j 个数的和是M的i-j
如果没有的话,输出求和大于M最小的i-j
我的思路:
一开始暴力求和各种超时和段错误,所以被迫用两个下标,sum记录i-j范围内的和,根据不同的情况移动 i j ,等j移动到最右而且sum<M的时候break
我的代码:
#include<bits/stdc++.h>
using namespace std;
int main(){
vector<pair<int,int> >pairs_equal;
vector<pair<int,int> >pairs_greater;
int N,M;
cin>>N>>M;
int nums[N]={0};
for(int i=0;i<N;i++)cin>>nums[i];
int sum=nums[0],left=0,right=0,minimized=INT_MAX;
while(1)
{
if(sum==M)
{
pairs_equal.push_back(pair<int,int>(left+1,right+1));
sum-=nums[left];
left++;
}
else if(sum<M)
{
right++;
if(right>=N)break;
sum+=nums[right];
}
else//sum>M
{
if(sum<minimized)
{
minimized=sum;
pairs_greater.clear();
pairs_greater.push_back(pair<int,int>(left+1,right+1));
}
else if(sum==minimized)
{
pairs_greater.push_back(pair<int,int>(left+1,right+1));
}
sum-=nums[left];
left++;
}
}
if(pairs_equal.size())
for(auto it:pairs_equal)cout<<it.first<<"-"<<it.second<<endl;
else
for(auto it:pairs_greater)cout<<it.first<<"-"<<it.second<<endl;
return 0;
}