Submission #1257905

#TimeUsernameProblemLanguageResultExecution timeMemory
1257905E_rKArt Exhibition (JOI18_art)C++20
0 / 100
7 ms14408 KiB
#include <bits/stdc++.h> #define fast cin.tie(0);cout.tie(0);ios_base::sync_with_stdio(false) #define pb push_back #define ppb pop_back #define fi first #define se second #define sp " " #define endl "\n" #define mod 1000000007 #define MAXN 200005 #define MAXM 1000006 #define inf 1e18 #define INF 0x3f #define all(v) v.begin(), v.end() #define rall(v) v.rbegin(), v.rend() #define debug(x) for(auto& a: x) cout << a << " " using namespace std; typedef long long int lo; lo n,m,q,k,l,a,b; lo arr[MAXN],sz[MAXN]; vector<lo> v[MAXN]; pair<lo,lo> item[MAXN]; lo kayit[MAXN]; string s[1005]; set<lo> st[MAXN]; lo cnt; lo p; vector<pair<lo,lo> > edges; bool check(lo mid){ return false; } void solve(){ cin >> n; for (int i = 1; i <= n; ++i) { cin >> item[i].fi >> item[i].se; } sort(item+1,item+n+1); lo val = item[1].se; lo bas = 1; lo soncev = item[1].se; lo basval = item[1].se; lo ans = 0; for (int i = 2; i <= n; ++i) { val += item[i].se; soncev = val-(item[i].fi-item[bas].fi); lo cikarirsam = (val-item[bas].se)-(item[i].fi-item[bas+1].fi); while(cikarirsam > soncev and bas < i) { val -= item[bas].se; bas++; soncev = cikarirsam; cikarirsam = (val) - (item[i].fi-item[bas+1].fi); } ans = max(ans,soncev); // cout << soncev << sp << bas << endl; } cout << ans << endl; // lo bas = 0; // lo son = 1000000000000000; // while(bas <= son){ // lo mid = (bas+son)/2; // if(check(mid)){ // bas = mid+1; // } // else{ // son = mid-1; // } // } } int main() { // cout << fixed << setprecision(12); // freopen("feast.in","r",stdin); // freopen("feast.out","w",stdout); // fast; int t = 1; // cin >> t; while(t--) { solve(); } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...