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, INF));
  35.  
  36. 	vector<int> prefix(n+1, 0);
  37. 	for(int i=0; i<n; i++){
  38. 		prefix[i+1] = prefix[i] + a[i];
  39. 	}
  40.  
  41. 	for(int gap=0; gap<n; gap++){
  42. 		for(int i=0, j=gap; j<n; i++, j++){
  43. 			if(gap == 0){
  44. 				dp[i][j] = 0;
  45. 			}
  46. 			else if(gap == 1){
  47. 				dp[i][j] = a[i]+a[j];
  48. 			}
  49. 			else{
  50.  
  51. 				for(int k=i; k<j; k++){
  52. 					dp[i][j] = min(dp[i][j] , dp[i][k] + dp[k+1][j]  );
  53. 				}
  54. 				dp[i][j] += prefix[j+1] - prefix[i];
  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. int practice(int n){
  77.  
  78.  
  79.     return 0;
  80. }
  81.  
  82.  
  83.  
  84.  
  85.  
  86. void solve() {
  87.  
  88.     int n;
  89.     cin>> n;
  90.  
  91.     a.resize(n);
  92.     for(int i=0; i<n; i++) cin >> a[i];
  93.  
  94.     cout << consistency(n) << endl;
  95.  
  96.  
  97. }
  98.  
  99.  
  100.  
  101.  
  102.  
  103. int32_t main() {
  104.     ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
  105.  
  106.     int t = 1;
  107.     // cin >> t;
  108.     while (t--) {
  109.         solve();
  110.     }
  111.  
  112.     return 0;
  113. }
Success #stdin #stdout 0s 5316KB
comments (?)
stdin
copy 
5
5 8 2 10 4
stdout
copy 
68
https://ideone.com/Lo8e8z
language:
C++14 (gcc 8.3)
created:
16 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!