1675G - Sorting Pancakes - CodeForces Solution

#include<bits/stdc++.h>
using namespace std ;
//#define int long long 
#define endl '\n' 
const int inf = 1e9 ;
const int maxn = 253 ;
int dp[maxn][maxn][maxn] ;
int mi[maxn][maxn][maxn] ;
void solve() { 
    int n , m ; cin >> n >> m ;
    vector<int> a(n + 1) , s(n + 1);
    for(int i = 1;i<=n;i++) cin >> a[i] , s[i] = s[i - 1] + a[i] ;
    
    memset(dp , 63 , sizeof dp ) ;
    memset(mi , 63 , sizeof mi ) ;
    dp[0][0][m] = 0 ;
    for(int i = 1;i<=n;i++) { 
        for(int j = 0 ;j<=m;j++) { 
            mi[i - 1][j][m] = min(mi[i - 1][j][m] , dp[i - 1][j][m]) ;
            for(int k = m - 1;k >= 0 ;k--) { 
                mi[i - 1][j][k] = min(dp[i - 1][j][k] , mi[i - 1][j][k + 1]) ;
            }
        }
        for(int j = 0 ;j<=m;j++) { 
            for(int k = 0;k<=j;k++) { 
                dp[i][j][k] = min(dp[i][j][k] , mi[i - 1][j - k][k] + abs(s[i] - j))  ;
            }
        }
    }
    int ans = 1e9 ;
    for(int i = 0;i<=m;i++) {
        ans = min(ans , dp[n][m][i]) ;
    }
    cout<<ans<<endl;
}

signed main()  {
     int t = 1 ;
     //cin >> t ;
     while(t--)  {
        solve() ;
     }
}