Submission #699290

#TimeUsernameProblemLanguageResultExecution timeMemory
699290mariam197Art Exhibition (JOI18_art)C++17
10 / 100
1092 ms340 KiB
#include<bits/stdc++.h> using namespace std; int n; long long a[500000],b[500000]; long long f(int i,long long s,long long mx,long long mn){ if(i==n){ if(mx==0 && mn==1e15+1){ return -1e16; } return s-(mx-mn); } long long s1=f(i+1,s+b[i],max(mx,a[i]),min(mn,a[i])); long long s2=f(i+1,s,mx,mn); return max(s1,s2); } int main() { ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0); cin>>n; for(int i=0;i<n;i++){ cin>>a[i]>>b[i]; } cout<<f(0,0,0,1e15+1); return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...