Submission #872776

#TimeUsernameProblemLanguageResultExecution timeMemory
872776DanetHolding (COCI20_holding)C++14
22 / 110
1 ms860 KiB
#include<bits/stdc++.h> using namespace std; #pragma GCC optimize("O3") #define tof_io ios_base::sync_with_stdio(false);cin.tie(0) , cout.tie(0); #define double long double #define int long long #define pb push_back #define all(x) x.begin(),x.end() #define endl '\n' const int mod = 998244353; //998244353 1e9+7 1e9+9 const int inf = 1e18; const int N = 60 + 23; const int lg = 23; int fac[N]; int inv[N]; int dnt_pow (int a, int b, int md = mod){int ans = 1; while(b){if(b&1){ans = (a*ans)%md;}a = (a*a)%md;b >>= 1;}return ans ;} void dnt_bld (){fac[0] = 1; inv[0] = dnt_pow(fac[0],mod-2) ;for(int i = 1 ; i < N ; i++) {fac[i] = (fac[i-1] * i) % mod;inv[i] = dnt_pow( fac[i] , mod-2);}} int dnt_ncr (int r,int n){if(r>n) return 0; return fac[n] * inv[r] % mod * inv[n-r] % mod;} bool cmp (pair<int,int> a, pair<int,int> b){ return a.second > b.second; } int dp[N][1000][N]; int n , k; int L = 0; int R = 0; int ans = 0; int32_t main() { cin >> n >> L >> R >> k; vector<int> a(n+1); for(int i = 1; i <= n; i++) { cin >> a[i]; } k = min(k, n * n / 4); for(int i = L; i <= n; i++) { for(int j = 1; j <= k; j++) { for(int i2 = L - 1; i2 > 0; i2--) { dp[i][j][i2] = max(dp[i][j][i2], dp[i - 1][j][i2]); dp[i][j][i2] = max(dp[i][j][i2], dp[i][j][i2 - 1]); if(j - i + i2 >= 0) { dp[i][j][i2] = max(dp[i][j][i2], dp[i - 1][j - i + i2][i2 - 1] + a[i] - a[i2]); } ans = max(ans, dp[i][j][i2]); } } } for(int i = L; i <= n; i++) ans = ans - a[i]; cout << abs(ans); }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...