fork download 
  1. #include <bits/stdc++.h>
  2. using namespace std;
  3. #define int              long long int
  4. #define double           long double
  5. #define print(a)         for(auto x : a) cout << x << " "; cout << endl
  6.  
  7.  
  8. const int M = 1000000007;
  9. const int N = 3e5+9;
  10. const int INF = 2e9+1;
  11. const int LINF = 2000000000000000001;
  12.  
  13. inline int power(int a, int b, int mod=M) {
  14.     int x = 1;
  15.     a %= mod;
  16.     while (b) {
  17.         if (b & 1) x = (x * a) % mod; 
  18.         a = (a * a) % mod;
  19.         b >>= 1;
  20.     }
  21.     return x;
  22. }
  23.  
  24.  
  25. //_ ***************************** START Below *******************************
  26.  
  27.  
  28.  
  29.  
  30. vector<int> a;
  31.  
  32. int consistency(int n, int x){
  33.  
  34. 	vector<vector<double>> dp(n+1, vector<double>(x+1, INT32_MIN));
  35.  
  36. 	dp[0][0] = 0;
  37. 	dp[1][1] = a[0];
  38.  
  39. 	for(int i=2; i<=n; i++){
  40.  
  41. 	    for(int k=1; k<=x; k++){
  42. 	    	dp[i][k] = max(dp[i][k] , dp[i][k-1]);
  43.  
  44.  
  45. 	        int j = i-1;
  46. 	        double sum = a[i-1];
  47. 	        int ct = 1;
  48. 	        while(j>=0){
  49.  
  50. 	            dp[i][k] = max(dp[i][k] , dp[j][k-1] + sum/ct );
  51. 	            if(j-1>=0) sum += a[j-1];
  52. 	            ct++;
  53. 	            j--;
  54. 	        }
  55. 	    }
  56. 	}
  57.  
  58. 	return dp[n][x];
  59. }
  60.  
  61.  
  62.  
  63.  
  64.  
  65.  
  66.  
  67.  
  68.  
  69.  
  70.  
  71.  
  72.  
  73.  
  74.  
  75. int practice(int n, int k){
  76.  
  77.  
  78.     return 0;
  79. }
  80.  
  81.  
  82.  
  83.  
  84.  
  85. void solve() {
  86.  
  87.     int n, k;
  88.     cin>> n >> k;
  89.  
  90.     a.resize(n);
  91.     for(int i=0; i<n; i++) cin >> a[i];
  92.  
  93.     cout << consistency(n, k) << endl;
  94.  
  95.  
  96. }
  97.  
  98.  
  99.  
  100.  
  101.  
  102. int32_t main() {
  103.     ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
  104.  
  105.     int t = 1;
  106.     // cin >> t;
  107.     while (t--) {
  108.         solve();
  109.     }
  110.  
  111.     return 0;
  112. }
Success #stdin #stdout 0.01s 5276KB
comments (?)
stdin 
5 3
9 1 2 3 9
stdout 
20
https://ideone.com/wDORuR
language:
C++14 (gcc 8.3)
created:
2 days ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!