Submission #1115725

#TimeUsernameProblemLanguageResultExecution timeMemory
1115725staszic_ojuzArt Exhibition (JOI18_art)C++17
100 / 100
437 ms19440 KiB
#include <bits/stdc++.h> using namespace std; using ll = long long; int main() { int n; cin >> n; vector<pair<ll, ll>> sv; ll suma = 0; sv.push_back({0, 0}); for(int i = 0; i < n; ++i) { ll a, b; cin >> a >> b; suma += b; sv.push_back({a, b}); } sort(sv.begin(), sv.end()); sv.push_back({0, 0}); ll sp[n+1]; sp[0] = 0; for(int i = 1; i <= n; ++i) sp[i] = sp[i-1] + sv[i].second - (sv[i+1].first - sv[i].first); ll mi = 0; ll odp = 0; for(int i = 1; i <= n; ++i) { odp = max(odp, sp[i]-mi+(sv[i+1].first - sv[i].first)); mi = min(mi, sp[i]); } cout << odp; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...