Interval DP acwing 282 Stone merging

Section DP AcWing 282. Stone merging

Original link

AcWing 282. Stone merging

Algorithm tags

Dynamic programming Section DP

Ideas

Code

#include<bits/stdc++.h>
#define int long long
#define rep(i, a, b) for(int i=a;i<b;++i)
#define Rep(i, a, b) for(int i=a;i>b;--i)
using namespace std;
const int N = 505;
int a[N], s[N], f[N][N];
inline int read(){
   int s=0,w=1;
   char ch=getchar();
   while(ch<'0'||ch>'9'){if(ch=='-')w=-1;ch=getchar();}
   while(ch>='0'&&ch<='9') s=s*10+ch-'0',ch=getchar();
   return s*w;
}
void put(int x) {
    if(x<0) putchar('-'),x=-x;
    if(x>=10) put(x/10);
    putchar(x%10^48);
}
signed main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int n=read();
    rep(i, 1, n+1){
        a[i]=read();
    }
    rep(i, 1, n+1){
        a[i]+=a[i-1];
    }
    //  Length of gravel pile   If the length of the stone pile is 1 f[1][1] Initial value 0, In line with the question   
    rep(len, 2, n+1){
    	//  The starting point of the stone pile 
        for(int i=1; i+len-1<=n; ++i){
        	//  The left and right ends of the gravel pile  
            int l=i, r=i+len-1;
            f[l][r]=1e8;
            //  Stone dividing point 
            rep(k, l, r){
                f[l][r]=min(f[l][r], f[l][k]+f[k][r]+s[r]-s[l-1]);
            }
        }
    }
    printf("%lld", f[1][n]);
    return 0;
}

Originality is not easy.
Reprint please indicate the source
If it helps you Don't forget to praise and support