fork download
copy 
  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){
  33.  
  34. 	vector<vector<int>> dp(n, vector<int>(n, 0));
  35.  
  36. 	for(int gap=0; gap<n; gap++){
  37. 	    for(int i=0,j=gap; j<n; i++, j++){
  38.  
  39. 	        if(gap == 0){
  40. 	            int left = i-1>=0 ? a[i-1] : 1;
  41. 	            int right = j+1 < n ? a[j+1] : 1;
  42. 	            dp[i][j] = left * a[i] * right;
  43. 	        }
  44. 	        else{
  45.  
  46. 	            for(int k=i; k<=j; k++){
  47. 	                int left = i-1>=0 ? a[i-1] : 1;
  48. 	                int right = j+1 < n ? a[j+1] : 1;
  49. 	                int cost = left * a[k] * right;
  50. 	                if(k-1>=i) cost += dp[i][k-1];
  51. 	                if(k+1<=j) cost += dp[k+1][j];
  52. 	                dp[i][j] = max(dp[i][j], cost);
  53. 	            }
  54. 	        }
  55. 	    }
  56. 	}
  57.  
  58.  
  59. 	return dp[0][n-1];
  60.  
  61. }
  62.  
  63.  
  64.  
  65.  
  66.  
  67.  
  68.  
  69.  
  70.  
  71.  
  72.  
  73.  
  74.  
  75.  
  76.  
  77. int practice(int n){
  78.  
  79.  
  80.     return 0;
  81. }
  82.  
  83.  
  84.  
  85.  
  86.  
  87. void solve() {
  88.  
  89.     int n;
  90.     cin>> n;
  91.  
  92.     a.resize(n);
  93.     for(int i=0; i<n; i++) cin >> a[i];
  94.  
  95.     cout << consistency(n) << endl;
  96.  
  97.  
  98. }
  99.  
  100.  
  101.  
  102.  
  103.  
  104. int32_t main() {
  105.     ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
  106.  
  107.     int t = 1;
  108.     // cin >> t;
  109.     while (t--) {
  110.         solve();
  111.     }
  112.  
  113.     return 0;
  114. }
Success #stdin #stdout 0s 5316KB
comments (?)
stdin
copy 
4
3 1 5 8
stdout
copy 
167
https://ideone.com/Rm3tHV
language:
C++14 (gcc 8.3)
created:
8 hours 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!