1173 How Many Ways to Buy a Piece of Land【前缀和】

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

题目意思： 

分析：一些土地被分成很多连续的块，每个都有售卖价格，在给定的金额下，进行连续土地的购买，问有多少种购买方式？

解析：前缀和法。先把前缀和都求出来，然后从1-n区间进行不同区间求和，只要满足区间和所用钱数小于等于给定金额即可为一种方法。

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=10005;
int a[N]={0},sum[N]={0}; 
int main(){
	ll n,m,way=0;
	cin>>n>>m;
	for(int i=1;i<=n;i++){ 
		cin>>a[i];
		if(a[i]<=m)way++;
	}
    for(int i=1;i<=n;i++)sum[i]=sum[i-1]+a[i];//前缀和的初始化
	for(int l=1;l<n;l++){
		for(int r=l+1;r<=n;r++){
			if(sum[r]-sum[l-1]<=m)way++;
		}
	}
	cout<<way; 
	return 0;
}