제출 #1064584

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1064584		beaconmc	Tricks of the Trade (CEOI23_trade)	C++14	20 / 100	224 ms	408656 KiB

trade

#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,n) dp[i][0] = 0;


	FOR(i,1,n+1){
		FOR(j,1,205){
			dp[i][j] = max(dp[i-1][j-1] + sell[i-1] - price[i-1], dp[i-1][j] - price[i-1]);
		}
	}
	ll ans = -100000000000000000;


	FOR(i,k,n+1){
		ans = max(ans, dp[i][k]);
	}
	cout << ans << endl;







}

• Subtask 0: 0 / 0
• Subtask 1: 5 / 10
• Subtask 2: 0 / 10
• Subtask 3: 5 / 10
• Subtask 4: 10 / 25
• Subtask 5: 0 / 45