제출 #318660

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
318660		neki	Sličice (COCI19_slicice)	C++14	90 / 90	142 ms	484 KiB

slicice

#include <bits/stdc++.h>
#define loop(i, a, b) for(long long i=a;i<b;i++)
#define pool(i, a, b) for(long long i=a-1;i>=b;i--)
#define fore(i, a) for(auto&& i:a)
#define fi first
#define se second
#define ps(a) push_back(a)
#define pb(a) pop_back(a)
#define sc scanf
#define vc vector
#define pa pair<ll, ll>
#define ll long long
#define lb lower_bound
#define ub upper_bound
#define all(a) a.begin(), a.end()
#define llmax LLONG_MAX/2
#define llmin -LLONG_MAX/2
using namespace std;
#define mn 510
#define pa pair<ll, ll>
#define ld long double 
ll arr[mn], rew[mn];
ll dp[mn], ndp[mn], neki[mn];
int main(){
    ll n, m, k;cin >> n>>m>>k;
    loop(i, 0, n) cin >> arr[i];
    loop(i, 0, m+1) cin >> rew[i];
    loop(i, 0, n){
        loop(j, 0, k+1) ndp[j]=0, neki[j]=0;
        loop(j, arr[i]+1, m+1) neki[j-arr[i]]=rew[j] - rew[arr[i]];
        loop(x, 0, k+1){
            loop(y, 0, k+1) if(x+y<=k) ndp[x+y]=max(ndp[x+y], dp[x]+neki[y]);
        }
        loop(j, 0, k+1) dp[j]=ndp[j];
    }
    ll ans=0;
    loop(i, 0, k+1) ans=max(ans, dp[i]);
    loop(i, 0, n) ans+=rew[arr[i]];
    cout << ans <<endl;
}

• Subtask 1: 90 / 90