DMOJ · cheerio1s3

Stock Trading

This C++ solution uses sorting & greedy for DMOJ cheerio1s3 Stock Trading. Read the reasoning, inspect the code, or try your own test case below.

cheerio1s3Sorting & searchingSorting & greedyC++45 lines
Solution201of 248
Open official problem ↗ Download C++ file ↓ Search the library → Open full Code Lab ↗ Report an issue ↗

Approach

Sorting & greedy

Stock Trading matches the price sequence and the code's extrema-based trend-profit calculation.

Sorting & searching

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

S_3_Stock_Trading.cpp

C++

    #include <bits/stdc++.h>
    using namespace std;
    using ll = long long;
    using i128 = __int128;
    const int inf = 1e9;
    const long long INF = 1e17; //❄️
    int main() {
        ios::sync_with_stdio(0); cin.tie(0); 
        int n; cin >> n;
        vector<pair<ll, ll>> v;
        for (int i = 0; i < n; i++) {
            ll x, y; cin >> x >> y;
            v.emplace_back(x, y);
        }
        ll cnt = 0;
        sort(v.begin(), v.end());
        auto slope_less = [&](int i, int a, int b) { // slope(i,a) <= slope(i,b)
            i128 lhs = (i128)(v[a].second - v[i].second) * (v[b].first - v[i].first);
            i128 rhs = (i128)(v[b].second - v[i].second) * (v[a].first - v[i].first);
            return lhs <= rhs;
        };
        auto slope_greater = [&](int i, int a, int b) { // slope(i,a) >= slope(i,b)
            i128 lhs = (i128)(v[a].second - v[i].second) * (v[b].first - v[i].first);
            i128 rhs = (i128)(v[b].second - v[i].second) * (v[a].first - v[i].first);
            return lhs >= rhs;
        };
        for (int i = 0; i < n; i++) {
            int mn = -1, mx = -1;
            for (int j = i + 1; j < n; j++) {
                bool flag = 1;
                if (mn != -1) {
                    if (!(slope_less(i, j, mn) || slope_greater(i, j, mx))) flag = 0;
                }
                if (flag) cnt++;
                if (mn == -1) {
                    mn = mx = j;
                } else {
                    if (slope_less(i, j, mn)) mn = j;
                    if (slope_greater(i, j, mx)) mx = j;
                }
            }
        }
        cout << cnt << '\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.