Problem:
Daruma Otoshi

You are playing a variant of a game called "Daruma Otoshi (Dharma Block Striking)".

At the start of a game, several wooden blocks of the same size but with varying weights
are stacked on top of each other, forming a tower.
Another block symbolizing Dharma is placed atop.
You have a wooden hammer with its head thicker than the height of a block,
but not twice that.

You can choose any two adjacent blocks, except Dharma on the top,
differing at most 1 in their weight,
and push both of them out of the stack with a single blow of your hammer.
The blocks above the removed ones then fall straight down,
without collapsing the tower.

You cannot hit a block pair with weight difference of 2 or more,
for that makes too hard to push out blocks while keeping the balance of the tower.
There is no chance in hitting three blocks out at a time,
for that would require superhuman accuracy.

The goal of the game is to remove as many blocks as you can.
Your task is to decide the number of blocks that can be removed
by repeating the blows in an optimal order.

Figure D1. Striking out two blocks at a time

In the above figure, with a stack of four blocks weighing 1, 2, 3, and
1, in this order from the bottom, you can hit middle
two blocks, weighing 2 and 3, out from the stack. The blocks above will
then fall down, and two blocks weighing 1 and the Dharma block will remain.
You can then push out the remaining pair of weight-1 blocks after that.

Input

The input consists of multiple datasets.
The number of datasets is at most 50.
Each dataset is in the following format.

n

w1 w2 … wn

n is the number of blocks, except Dharma on the top.
n is a positive integer not exceeding 300.
wi gives the weight of the i-th block counted from the bottom.
wi is an integer between 1 and 1000, inclusive.

The end of the input is indicated by a line containing a zero.

Output

For each dataset, output in a line the maximum number of blocks you can remove.

Sample Input

4
1 2 3 4
4
1 2 3 1
5
5 1 2 3 6
14
8 7 1 4 3 5 4 1 6 8 10 4 6 5
5
1 3 5 1 3
0

Output for the Sample Input

4
4
2
12
0

Solution in C++14 (judge verdict: Wrong Answer)

#include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<(n); i++)
#define X first
#define Y second

using namespace std;
typedef pair<int,int> pii;

int main(){
	int n;
	while(cin >> n, n){

		int w[1004] = {};
		rep(i,n) cin >> w[i];

		bool dp1[305][305]={};
		vector<pii> v;
		rep(i,n-1) if( abs(w[i] - w[i+1]) < 2 ){
			dp1[i][i+1] = true;
			v.emplace_back(i, i+1);
		}
		rep(k,n){
			rep(i,n){
				if( i+k >= n ) break;
				if( dp1[i][i+k] && 0 < i && i+k+1 < n ){
					if( abs(w[i-1] - w[i+k+1]) < 2 ){
						dp1[i-1][i+k+1] = true;
						v.emplace_back(i-1, i+k+1);
					}
				}
			}
			rep(j,n) rep(i,n){
				if( i+k+j >= n ) break;
				if( dp1[i][i+k] && dp1[i+k+1][i+k+j] ){
					dp1[i][i+k+j] = true;
					v.emplace_back(i, i+k+j);
				}
			}
		}

		//for(auto t: v) cout << t.X << "," << t.Y << " "; cout << endl;
		sort( v.begin(), v.end() );
		v.erase(unique(v.begin(), v.end()), v.end());

		int dp[900005] = {}, pos=0;
		rep(i,n) rep(k,n){
			if( i+k >= n ) break;
			if( dp1[i][i+k] ){
				dp[i+k+1] = max( dp[i+k+1], dp[i] + k+1 );
			}
			dp[i+1] = max( dp[i+1], dp[i] );
		}
//		rep(i,n) cout << dp[i] << " "; cout << endl;
		cout << dp[n] << endl;
//		rep(i,900002){
//			while( pos < v.size() && v[pos].first == i ){
//				int d  = v[pos].X;
//				int nx = v[pos].Y + 1;
//				dp[nx] = max( dp[nx], dp[i] + nx - d );
//				pos++;
//			}
//			dp[i+1] = max( dp[i+1], dp[i] );
//		}
//		cout << dp[900002] << endl;
	}
	return 0;
}