DMOJ · acmtryouts0a

ACM U of T Tryouts C0 A - Max Flow

This C++ solution uses maximum flow for DMOJ acmtryouts0a ACM U of T Tryouts C0 A - Max Flow. Read the reasoning, inspect the code, or try your own test case below.

acmtryouts0aGraphs & treesMaximum flowC++19 lines
Solution139of 248
Open official problem ↗ Download C++ file ↓ Search the library → Open full Code Lab ↗ Report an issue ↗

Approach

Maximum flow

Max Flow scenario input and maximum-flow-value output match the simple maximum computation.

Graphs & trees

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

Max_Flow.cpp

C++

    #include <bits/stdc++.h>
    using namespace std;
    using ll = long long;
    const int inf = 1e9;
    const long long INF = 1e17; //❄️
    int main() {
        ios::sync_with_stdio(0); cin.tie(0); 
        int t, n; cin >> t;
        while (t--) {
            cin >> n;
            int ans = 0;
            for (int i = 0; i < n; i++) {
                int x; cin >> x;
                ans = max(ans, x);
            }
            cout << ans << '\n';
        }
        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.