为啥校内OJ能过，洛谷上会RE？

#include<bits/stdc++.h>
using namespace std;
int n;
int a[440];
int dp[440][440];
struct node{
	int val,ij;
}b[420];
bool cmp(node x,node y){
	return x.val<y.val;
}
signed main(){
//	freopen("riceballs.in","r",stdin);
//	freopen("riceballs.out","w",stdout); 
//	ios::sync_with_stdio(0);
//	cin.tie(0),cout.tie(0);
	cin>>n;
	
	int ans=0;
	for(int i=1;i<=n;i++){
		cin>>a[i];
		ans=max(ans,a[i]);
		for(int j=1;j<=n;j++){
			dp[i][j]=-1e9;
		}
	}
	dp[1][1]=a[1];
	for(int i=2;i<=n;i++){
		dp[i][i]=a[i];
		if(a[i]==a[i-1]) dp[i-1][i]=a[i]*2,ans=max(ans,a[i]*2);
	}
	
	for(int len=3;len<=n;len++){
		for(int l=1;l+len-1<=n;l++){
			int r=l+len-1;
			int cnt=0;
			for(int ll=l;ll<=r-1;ll++){
				if(dp[l][ll]==dp[ll+1][r]) dp[l][r]=max(dp[l][r],dp[l][ll]*2);  //第一种合并方式 
				if(dp[l][ll]>=0){
					b[++cnt].val=dp[l][ll];
					b[cnt].ij=ll; 
				}
			}
			sort(b+1,b+1+cnt,cmp);
			int fl=1;
			for(int rr=r;rr>l;rr--){
				if(dp[rr][r]>=0){
					while(b[fl].val<dp[rr][r]&&b[fl].ij<rr-1) fl++;  
					if(fl>cnt||b[fl].ij>=rr-1) break;
					if(fl<=cnt&&b[fl].val==dp[rr][r]){
//						cout<<b[fl].val<<" "<<" "<<b[fl].ij<<" "<<dp[rr][r]<<endl;
						dp[l][r]=max(b[fl].val+dp[rr][r]+dp[b[fl].ij+1][rr-1],dp[l][r]);
					}
				}
//				cout<<rr<<endl;
			}
			ans=max(ans,dp[l][r]);
//			cout<<l<<" "<<r<<" "<<dp[l][r]<<endl;
		}

	}
	cout<<ans<<endl;
	return 0;
}