Codeforces · 2204B

Right Maximum

This C++ solution uses prefix sums for Codeforces 2204B Right Maximum. Read the reasoning, inspect the code, or try your own test case below.

2204BArrays & prefix sumsPrefix sumsC++26 lines
Solution176of 248
Open official problem ↗ Download C++ file ↓ Search the library → Open full Code Lab ↗ Report an issue ↗

Approach

Prefix sums

Right Maximum matches the array input and the code's count of required prefix-maximum operations.

Arrays & prefix sums

Problem and code

Useful links.

Written by benbenyaojifen. Try the problem first, then compare your approach with the code.

Open official problem ↗View exact source file ↗
Implementation

B_Right_Maximum.cpp

C++

    #include <bits/stdc++.h>
    using namespace std;
    using ll = long long;
    using i128 = __int128;
    const int inf = 1e9;
    const ll INF = 1e18; //❄️
    void solve() {
        int n; cin >> n;
        vector<int> pre(n + 1);
        for (int i = 1; i <= n; i++) cin >> pre[i];
        //prefix max
        int ans = 0;
        for (int i = 1; i <= n; i++) {
            if (pre[i] >= pre[i - 1]) ans++;
            pre[i] = max(pre[i], pre[i - 1]);
        }
        cout << ans << '\n';
    }
    int main() {
        ios::sync_with_stdio(0); cin.tie(0); 
        int t; cin >> t;
        while (t--) {
            solve();
        }
        return 0;
    }
        

Did this explanation save you time? I'm a Grade 11 student building this free library to make difficult algorithms easier to understand.

Buy me a coffee ↗Keep studying →

Test this problem

Run your code here.

Paste your code, run a test case, compare the output, or trace selected values.

Full trace, comparison & stress testing ↗
StatusReady
Output
No run yet.
Diagnostics
No diagnostics yet.

Each run is isolated and has strict limits. Passing one test does not guarantee the judge will accept the solution.