# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
106258 | hamzqq9 | Sličice (COCI19_slicice) | C++14 | 115 ms | 1404 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
#define st first
#define nd second
#define pb push_back
#define pf push_front
#define ppb pop_back
#define ppf pop_front
#define umax(x,y) x=max(x,y)
#define umin(x,y) x=min(x,y)
#define ll long long
#define ii pair<int,int>
#define iii pair<ii,int>
#define iiii pair<ii,ii>
#define sz(x) ((int) x.size())
#define orta ((bas+son)/2)
#define all(x) x.begin(),x.end()
#define pw(x) (1<<(x))
#define inf 100000009
#define MOD 998244353
#define N 200005
#define M 2500005
#define LOG 20
#define KOK 300
#define EPS 0.0000001
using namespace std;
int main() {
int n,m,k;
scanf("%d %d %d",&n,&m,&k);
vector<int> cur(n+1),b(m+1);
for(int i=1;i<=n;i++) scanf("%d",&cur[i]);
for(int i=0;i<=m;i++) scanf("%d",&b[i]);
vector<vector<int>> dp(n+1,vector<int>(k+1,-inf));
int ans=0;
dp[0][0]=0;
for(int i=1;i<=n;i++) {
for(int j=0;j<=k;j++) {
for(int l=0;l<=min(j,m-cur[i]);l++) {
umax(dp[i][j],dp[i-1][j-l]+b[cur[i]+l]);
umax(ans,dp[i][j]);
}
}
}
printf("%d",ans);
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |