AC但问

for(int len=2;len<=n;len++)
        for(int l=1;l+len-1<=n;l++){
            int r=l+len-1;
            int all0=sum[l]+sum[n]-sum[r];
            dp[l][r][0]=min(dp[l+1][r][0]+(pos[l+1]-pos[l])*all0, dp[l+1][r][1]+(pos[r]-pos[l])*all0);  
            int all1=sum[l-1]+sum[n]-sum[r-1];
            dp[l][r][1]=min(dp[l][r-1][0]+(pos[r]-pos[l])*all1, dp[l][r-1][1]+(pos[r]-pos[r-1])*all1);
        }

for(int len=2;len<=n;len++)
    {
    	for(int l=1;l+len-1<=n;l++){
            int r=l+len-1;
            dp[l][r][0]=min(dp[l+1][r][0]+(pos[l+1]-pos[l])*(sum[l]+sum[n]-sum[r]), dp[l+1][r][1]+(pos[r]-pos[l])*(sum[l]+sum[n]-sum[r]));
            dp[l][r][1]=min(dp[l][r-1][0]+(pos[r]-pos[l])*(sum[l-1]+sum[n]-sum[r-1]), dp[l][r-1][1]+(pos[r]-pos[r-1])*(sum[l-1]+sum[n]-sum[r-1]));
        }
	}