PAT 2020年秋季 7-2 How Many Ways to Buy a Piece of Land (25 分)
The land is for sale in CyberCity, and is divided into several pieces. Here it is assumed that each piece of land has exactly two neighboring pieces, except the first and the last that have only one. One can buy several contiguous(连续的) pieces at a time. Now given the list of prices of the land pieces, your job is to tell a customer in how many different ways that he/she can buy with a certain amount of money.
Input Specification:
Each input file contains one test case. Each case first gives in a line two positive integers: N (≤104), the number of pieces of the land (hence the land pieces are numbered from 1 to N in order), and M (≤109), the amount of money that your customer has.
Then in the next line, N positive integers are given, where the i-th one is the price of the i-th piece of the land.
It is guaranteed that the total price of the land is no more than 109.
Output Specification:
For each test case, print the number of different ways that your customer can buy. Notice that the pieces must be contiguous.
Sample Input:
复制5 85
38 42 15 24 9
Sample Output:
11
Hint:
The 11 different ways are:
38
42
15
24
9
38 42
42 15
42 15 24
15 24
15 24 9
24 9
实现思路:
如同链表一样串起来的土地,每块地有不同的价值,给出手上的钱,给出购买地的不同种方式,一开始就发现这题pat题目有过相似类型的,二分上手就可以做,后来发现暴力也ok,就是直接双循环,那就简单很多了。
AC代码:
#include <iostream>
#include <vector>
using namespace std;
vector<int> sq,res;
int n,total,val;
int main() {
cin>>n>>total;
sq.resize(n+1);
res.resize(n+1);
sq[0]=0;
for(int i=1; i<=n; i++) {
scanf("%d",&sq[i]);
res[i]=sq[i];
sq[i]+=sq[i-1];
}
int ans=0;
for(int i=1; i<=n; i++) {
for(int j=i+1; j<=n; j++) {
if(sq[j]-sq[i-1]<=total) {
ans++;
} else break;
}
}
for(int i=1; i<=n; i++)
if(res[i]<=total) ans++;
cout<<ans;
return 0;
}
【推荐】国内首个AI IDE,深度理解中文开发场景,立即下载体验Trae
【推荐】凌霞软件回馈社区,携手博客园推出1Panel与Halo联合会员
【推荐】轻量又高性能的 SSH 工具 IShell:AI 加持,快人一步
· 长文讲解 MCP 和案例实战
· Hangfire Redis 实现秒级定时任务,使用 CQRS 实现动态执行代码
· Android编译时动态插入代码原理与实践
· 解锁.NET 9性能优化黑科技:从内存管理到Web性能的最全指南
· 通过一个DEMO理解MCP(模型上下文协议)的生命周期
· 工良出品 | 长文讲解 MCP 和案例实战
· 多年后再做Web开发,AI帮大忙
· 记一次 .NET某旅行社酒店管理系统 卡死分析
· centos停服,迁移centos7.3系统到新搭建的openEuler
· 上周热点回顾(4.14-4.20)