SPOJ: MIXTURES (MCM DP)

SPOJ: MIXTURES

///==================================================///
///                HELLO WORLD !!                    ///
///                  IT'S ME                         ///
///               BISHAL GAUTAM                      ///
///         [ bsal.gautam16@gmail.com ]              ///
///==================================================///
#include<bits/stdc++.h>
#define X first
#define Y second
#define mpp make_pair
#define nl printf("\n")
#define SZ(x) (int)(x.size())
#define pb(x) push_back(x)
#define pii pair<int,int>
#define pll pair<ll,ll>
///---------------------
#define S(a) scanf("%d",&a)
#define P(a) printf("%d",a)
#define SL(a) scanf("%lld",&a)
#define S2(a,b) scanf("%d%d",&a,&b)
#define SL2(a,b) scanf("%lld%lld",&a,&b)
///------------------------------------
#define all(v) v.begin(),v.end()
#define CLR(a) memset(a,0,sizeof(a))
#define SET(a) memset(a,-1,sizeof(a))
#define fr(i,a,n) for(int i=a;i<=n;i++)
using namespace std;
typedef long long ll;
///==========CONSTANTS=============///
///  Digit     0123456789012345678 ///
#define MX     102
#define inf    2000000000
#define MD     1000000007LL
#define eps    1e-9
///===============================///

int ar[MX+2],br[MX+2];
ll dp[MX][MX];
ll go(int l,int r) {
    if(l==r) return 0LL;
    ll &ret=dp[l][r];
    if(ret!=-1) return ret;
    ret=(ar[l]*( (br[r]-br[l])%100 ) )+go(l+1,r);
    for(int i=l+1; i<=r-1; i++) {
        ll lx=(br[i]-br[l-1])%100;
        ll rx=(br[r]-br[i])%100;
        ret=min(ret,lx*rx+go(l,i)+go(i+1,r));
    }
    return ret;
}

int main() {
    int tc,cs=1,i,j,k,n;
    while(S(n)==1) {
        br[0]=0LL;
        fr(i,1,n) {
            S(ar[i]);
            br[i]=(br[i-1]+ar[i]);
        }
        SET(dp);
        ll ans=go(1,n);
        printf("%lld\n",ans);
    }
    return 0;
}