7-2 How Many Ways to Buy a Piece of Land (25 分)

我成为一只小羊

于 2021-03-15 10:44:22 发布

阅读量188

点赞数

CC 4.0 BY-SA版权

分类专栏：题解

本文链接：https://blog.csdn.net/Exupery_/article/details/114821807

题解专栏收录该内容

22 篇文章

订阅专栏

#include <iostream>
#include <vector>

using namespace std;

int main() {
    int N, M;
    cin >> N >> M;

    vector<int> prices(N);
    for (int i = 0; i < N; i++) {
        cin >> prices[i];
    }

    int ways = 0;
    for (int len = 1; len <= N; len++) {
        int sum = 0;
        for (int i = 0; i < len; i++) {
            sum += prices[i];
        }
        if (sum <= M) {
            ways++;
        }
        for (int i = len; i < N; i++) {
            sum -= prices[i - len];
            sum += prices[i];
            if (sum <= M) {
                ways++;
            }
        }
    }

    cout << ways;
}