Submission #1064568

#TimeUsernameProblemLanguageResultExecution timeMemory
1064568beaconmcTricks of the Trade (CEOI23_trade)C++14
20 / 100
699 ms408656 KiB
#include <bits/stdc++.h> typedef long long ll; #define FOR(i,x,y) for(ll i=x; i<y; i++) #define FORNEG(i,x,y) for(ll i=x; i>y; i--) using namespace std; ll dp[250005][205]; int main(){ ios_base::sync_with_stdio(false); cin.tie(NULL); FOR(i,0,250005)FOR(j,0,205) dp[i][j] = -100000000000000000; ll n,k; cin >> n >> k; vector<ll> price(n), sell(n); FOR(i,0,n) cin >> price[i]; FOR(i,0,n) cin >> sell[i]; FOR(i,0,250005) dp[i][0] = 0; FOR(j,0,205){ FOR(i,0,n){ dp[i+1][j] = max(dp[i+1][j], dp[i][j] - price[i]); dp[i+1][j+1] = max(dp[i+1][j+1], dp[i][j] - price[i] + sell[i]); } } ll ans = -100000000000000000; FOR(i,k,n+1){ ans = max(ans, dp[i][k]); } cout << ans << endl; }
#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...