有几个人见过呢?

1 comments

  • @ 2026-5-20 21:54:46

    #include <iostream> using namespace std; int main() { int n, m; cin >> n >> m; int cnt = 1; // 最少至少1段 int sum = 0; // 当前段的和 for (int i = 0; i < n; i++) { int x; cin >> x; // 如果加上当前数超过m,就必须新开一段 if (sum + x > m) { cnt++; // 段数+1 sum = x; // 当前段从x开始 } else { sum += x; // 否则继续加在当前段 } } cout << cnt << endl; return 0; }没过的看这

    • 1

    Information

    ID
    78
    Time
    1000ms
    Memory
    256MiB
    Difficulty
    4
    Tags
    # Submissions
    82
    Accepted
    37
    Uploaded By