pat-a1044. Shopping in Mars (25)
2016-12-28 16:08
246 查看
今天状态不是很好,随便a个题休息下吧
这个题就是二分查找,还是看了下宝典。二分函数还是学学,学会使用upper_bound这个函数可以减少代码量,后面弄吧
#include<cstdio>
#include<algorithm>
using namespace std;
int num[100010];
const int inf=100000001;
int findpos(int low,int high,int x){
while(low<=high){
int mid=(low+high)/2;
if(num[mid]>x) high=mid-1;
else if(num[mid]<x) low=mid+1;
else return mid;
}
return -1;
}
int main(){
int n,s,ok=0,nears,t;
scanf("%d%d",&n,&s);
nears=inf;
num[0]=0;
for(int i=1;i<=n;++i){
scanf("%d",&t);
num[i]=num[i-1]+t;
}
for(int i=0;i<=n;++i){
for(int j=i;j<=n;++j)
if(num[j]-num[i]==s){
nears=s;
ok=1;
break;
}
else if(num[j]-num[i]>s){
nears=min(nears,num[j]-num[i]);
break;
}
if(ok) break;
}
for(int i=0;i<=n;++i){
int pos=findpos(i+1,n,num[i]+nears);
if(pos!=-1) printf("%d-%d\n",i+1,pos);
}
return 0;
}
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:
Sample Output 1:
Sample Input 2:
Sample Output 2:
这个题就是二分查找,还是看了下宝典。二分函数还是学学,学会使用upper_bound这个函数可以减少代码量,后面弄吧
#include<cstdio>
#include<algorithm>
using namespace std;
int num[100010];
const int inf=100000001;
int findpos(int low,int high,int x){
while(low<=high){
int mid=(low+high)/2;
if(num[mid]>x) high=mid-1;
else if(num[mid]<x) low=mid+1;
else return mid;
}
return -1;
}
int main(){
int n,s,ok=0,nears,t;
scanf("%d%d",&n,&s);
nears=inf;
num[0]=0;
for(int i=1;i<=n;++i){
scanf("%d",&t);
num[i]=num[i-1]+t;
}
for(int i=0;i<=n;++i){
for(int j=i;j<=n;++j)
if(num[j]-num[i]==s){
nears=s;
ok=1;
break;
}
else if(num[j]-num[i]>s){
nears=min(nears,num[j]-num[i]);
break;
}
if(ok) break;
}
for(int i=0;i<=n;++i){
int pos=findpos(i+1,n,num[i]+nears);
if(pos!=-1) printf("%d-%d\n",i+1,pos);
}
return 0;
}
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
相关文章推荐
- pat 1006 Sign In and Sign Out (25)
- 1060. Are They Equal (25)-PAT甲级真题
- PAT-A 1024. Palindromic Number (25)
- 1093. Count PAT's (25)
- 编程题目: PAT 1025. 反转链表 (25)
- PAT乙级 1065. 单身狗(25)
- 1005. 继续(3n+1)猜想 (25)——PAT
- PAT (Advanced Level) Practise 1025. PAT Ranking (25)
- 1025. PAT Ranking (25)
- PAT 1048. Find Coins (25) 常见哈希应用,空间换时间
- PAT 甲级-1003. Emergency (25)
- 1040. Longest Symmetric String (25)-PAT甲级真题
- 1083. List Grades (25)-PAT甲级真题
- PAT乙级 1060. 爱丁顿数(25)--数学问题,sort()排序要注意的问题
- B1040. 有几个PAT(25)
- 1030. 完美数列(25)-浙大PAT乙级真题java实现
- PAT(甲级)1012. The Best Rank (25)
- PAT (Basic Level) Practise (中文)1005. 继续(3n+1)猜想 (25)
- PAT 1003 Emergency (25)
- [PAT乙级]1015. 德才论 (25)