Submission

[PPPPPPPPPPPPPPP]

Score: 100

User: Nagornz

Problemset: จุดตัดบนกราฟ

Language: cpp

Time: 0.055 second

Submitted On: 2025-03-25 18:09:41

#include <bits/stdc++.h>
#define int long long
#define double long double
#define pii pair <int,int>
#define tiii tuple <int, int, int>
#define f first
#define s second
#define all(x) x.begin(), x.end()
#define ub(a, b) upper_bound(a.begin(), a.end(), b) - a.begin()
#define lb(a, b) lower_bound(a.begin(), a.end(), b) - a.begin()
#define ve vector
#define graph(a, n) vector <int> a[n];
#define wgraph(a, n) vector <pii> a[n];
#define emb emplace_back
#define em emplace
#define ins insert
#define er erase
#define iShowSpeed cin.tie(NULL)->sync_with_stdio(false)

using namespace std;

template <typename T>
using greater_priority_queue = priority_queue<T, vector<T>, greater<T>>;

const int mod = 1e9 + 7;
const int inf = 1e18;

int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};

int32_t main(){
    iShowSpeed;
    int n; cin >> n;
    map <int, int> a;
    int prev; cin >> prev;
    for (int i = 1; i < n; i++) {
        int x; cin >> x;
        int mn = min(x, prev);
        int mx = max(prev, x);
        prev = x;
        a[mn]++;
        a[mx]--;
    }
    int ans = 0;
    int sum = 0;
    for (auto [idx, cnt] : a) {
        sum += cnt;
        ans = max(ans, sum);
    }
    cout << ans;
}