Submission #1326265

#TimeUsernameProblemLanguageResultExecution timeMemory
1326265aren_danceTricks of the Trade (CEOI23_trade)C++20
5 / 100
107 ms7252 KiB
#include <bits/stdc++.h>
using namespace std;
#define ll long long
const int N=5e5+1;
ll c[N];
ll s[N];
ll pref[N];
void upsolve(){
	int n,k;
	cin>>n>>k;
	for(int i=1;i<=n;++i){
		cin>>c[i];
		pref[i]=pref[i-1]+c[i];
	}
	for(int i=1;i<=n;++i){
		cin>>s[i];
	}
	vector<int> a(n+1,0);
	ll answ=-1e18;
	ll cur=s[1];
	for(int i=2;i<=n;++i){
		answ=max(answ,cur-pref[i]+s[i]);
		cur=max(cur,pref[i-1]+s[i]);
	}
	cout<<answ<<'\n';
}
int main()
{
	int t;
	t=1;
	while(t--){
		upsolve();
	}
	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...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...