Go: package main

import (
	"bufio"
	_ "container/heap"
	"fmt"
	"os"
	_ "sort"
	"strconv"
)

// I/O
type Scanner struct {
	sc *bufio.Scanner
}

func NewScanner() *Scanner {
	sc := bufio.NewScanner(os.Stdin)
	sc.Split(bufio.ScanWords)
	sc.Buffer(make([]byte, 1024), int(1e+9))
	return &Scanner{sc}
}

func (s *Scanner) nextStr() string {
	s.sc.Scan()
	return s.sc.Text()
}

func (s *Scanner) nextInt() int {
	i, e := strconv.Atoi(s.nextStr())
	if e != nil {
		panic(e)
	}
	return i
}

func (s *Scanner) nextFloat() float64 {
	f, e := strconv.ParseFloat(s.nextStr(), 64)
	if e != nil {
		panic(e)
	}
	return f
}

func (s *Scanner) nextRuneSlice() []rune {
	return []rune(s.nextStr())
}

func (s *Scanner) nextIntSlice(n int) []int {
	res := make([]int, n)
	for i := 0; i < n; i++ {
		res[i] = s.nextInt()
	}
	return res
}

func (s *Scanner) nextFloatSlice(n int) []float64 {
	res := make([]float64, n)
	for i := 0; i < n; i++ {
		res[i] = s.nextFloat()
	}
	return res
}

// Arithmetic
func max(nums ...int) int {
	m := nums[0]
	for _, i := range nums {
		if m < i {
			m = i
		}
	}
	return m
}

func min(nums ...int) int {
	m := nums[0]
	for _, i := range nums {
		if m > i {
			m = i
		}
	}
	return m
}

func abs(x int) int {
	if x > 0 {
		return x
	}
	return -x
}

func pow(x, y int) int {
	res := 1
	for i := 0; i < y; i++ {
		res *= x
	}
	return res
}

func ceil(a, b int) int {
	if a%b == 0 {
		return a / b
	} else {
		return a/b + 1
	}
}

func gcd(a, b int) int {
	if b == 0 {
		return a
	}
	return gcd(b, a%b)
}

func lcm(a, b int) int {
	return a / gcd(a, b) * b
}

// Sort
type RuneSlice []rune

func (a RuneSlice) Len() int           { return len(a) }
func (a RuneSlice) Less(i, j int) bool { return a[i] < a[j] }
func (a RuneSlice) Swap(i, j int)      { a[i], a[j] = a[j], a[i] }

// Main
const MOD = int(1e+9) + 7
const INF = 1 << 60

func main() {
	sc := NewScanner()
	wtr := bufio.NewWriter(os.Stdout)
	defer wtr.Flush()
	for true {
		N, M := sc.nextInt(), sc.nextInt()
		if N == 0 && M == 0 {
			break
		}
		C := sc.nextIntSlice(M)
		X := sc.nextIntSlice(N)
		dp := make([][256]int, N+1)
		for i := 0; i < N+1; i++ {
			for j := 0; j < 256; j++ {
				dp[i][j] = INF
			}
		}
		dp[0][128] = 0
		for i := 0; i < N; i++ {
			for j := 0; j < 256; j++ {
				if dp[i][j] == INF {
					continue
				}
				for k := 0; k < M; k++ {
					nex := j + C[k]
					if nex < 0 {
						nex = 0
					}
					if nex > 255 {
						nex = 255
					}
					dp[i+1][nex] = min(dp[i+1][nex], dp[i][j]+pow(X[i]-nex, 2))
				}
			}
		}
		ans := INF
		for i := 0; i < 256; i++ {
			ans = min(ans, dp[N][i])
		}
		fmt.Fprintln(wtr, ans)
	}
}

C++: #include <iostream>
#include <vector>
#include <climits>
int square(int x){
	return x * x;
}
int main()
{
	using namespace std;
	int N, M, i, j, c, k, v, y, sub_sq, min;
	vector <int> C, x;
	while (true)
	{
		cin >> N >> M;
		if (N == 0 and M == 0) break;
		vector < vector<int> > dp(N+1);
		C.resize(M); x.resize(N);
		for (i=0;i<=N;i++){dp[i].resize(256); for (j=0;j<256;j++) dp[i][j] = INT_MAX;}
		for (i=0;i<M;i++) cin >> C[i];
		for (i=0;i<N;i++) cin >> x[i];
		dp[0][128] = 0;
		for(i = 0; i < N; i++)
		{
			for (k = 0; k < 256; k++)
			{
				v = dp[i][k];
				if (v == INT_MAX) continue; 
				for(j = 0; j < M; j++)
				{
					c = C[j];
					if (k + c > 255) y = 255; else if (k + c < 0) y = 0; else y = k + c;
					sub_sq = square(x[i]-y);
					if(v + sub_sq < dp[i+1][y]) dp[i+1][y] = v + sub_sq;
				}
			}
		}
		min = INT_MAX;
		for(k = 0; k < 256; k++) min = min <= dp[N][k] ? min : dp[N][k];  
		cout << min << endl;
	}
	return 0;
}

C++: #include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
typedef long long LL;
typedef vector<LL> VLL;
typedef vector<VLL> VVLL;
typedef vector<int> VI;
typedef vector<VI> VVII;
const LL INF = (LL)1e9 *(LL)1e9;
using namespace std;

int main(){
	while (1){
		int N, M;
		cin >> N >> M;
		if (N + M == 0)return 0;
		VI x(N+1),C(M+1);
		for (int i = 0; i < M; i++){
			cin >> C[i];
		}
		for (int i = 1; i < N+1; i++){
			cin >> x[i];
		}
		VVLL dp(N + 1, VLL(256, INF));
		dp[0][128] = 0;
		for (int n = 0; n < N; n++){
			for (int i = 0; i < 256; i++){
				for (int j = 0; j < M; j++){
					int r = i + C[j];
					if (r>255)r = 255;
					else if (r < 0)r = 0;
					dp[n + 1][r] = min(dp[n+1][r],dp[n][i] + (x[n + 1] - r)*(x[n + 1] - r));
				}
			}
		}
		LL res = INF;
		for (int i = 0; i < 256; i++){
			res = min(res, dp[N][i]);
		}
		cout << res << endl;

	}

	return 0;
}

C++: #include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
using namespace std;

int main(){
  int i,j,k,n,m;
  while(cin >> n >> m && n && m){
    vector<int> C,x;
    for(i=0;i<m;i++){
      int a;
      cin >> a;
      C.push_back(a);
    }
    for(i=0;i<n;i++){
      int a;
      cin >> a;
      x.push_back(a);
    }

    long long y[256][2];
    for(i=0;i<256;i++) y[i][0] = y[i][1] = -1;
    y[128][0] = 0;

    for(i=0;i<n;i++){
      for(j=0;j<m;j++){
	for(k=0;k<256;k++){
	  if(y[k][0] != -1){
	    int a = k + C[j];
	    if(a < 0) a = 0;
	    else if(a > 255) a = 255;

	    if(y[k][0] > (long long)(pow(10.0,18))) continue;

	    if(y[a][1] == -1) y[a][1] = y[k][0]+(x[i]-a)*(x[i]-a);
	    else y[a][1] = min(y[a][1],y[k][0]+(x[i]-a)*(x[i]-a));
	  }
	}
      }
      for(j=0;j<256;j++){
	y[j][0] = y[j][1];
	y[j][1] = -1;
      }
    }

    long long ans = -1;
    for(i=1;i<256;i++){
      if(y[i][0] != -1){
	if(ans == -1) ans = y[i][0];
	else ans = min(ans,y[i][0]);
      }
    }

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

C++: #include <iostream>
#include <vector>
#include <string>
#include <algorithm>
using namespace std;
//方針：DP
int min(int p, int q){
	if (p < q) return p;
	return q;
}
int rss(int p, int q){
	return (p - q)*(p - q);
}
int limit(int i) {
	if (i > 255) return 255;
	if (i < 0) return 0;
	return i;
}
int main(void){
	//FILE* fp_in = freopen("data.txt", "r", stdin);
 
	vector< vector< int > > dp;
	vector<int> dpp;
	for (int i = 0; i < 20001; i++)
		dpp.push_back(1 << 30);
	for (int i = 0; i < 257; i++)
		dp.push_back(dpp);
 
	while (1){
		int N, M;
		vector<int> c, x;
		cin >> N >> M;
		if (N == 0 && M == 0) break;
		for (int i = 0; i < M; i++) {
			int tmp;
			cin >> tmp;
			c.push_back(tmp);
		}
		for (int i = 0; i < N; i++) {
			int tmp;
			cin >> tmp;
			x.push_back(tmp);
		}
		for (int i = 0; i < 256; i++)
			for (int j = 0; j < 10000; j++)
				dp[i][j] = 1 << 30;
  
		for (int i = 0; i < 256; i++)
			dp[i][0] = 0;
		for (int i = 0; i < M; i++) {
			dp[limit(128 + c[i])][1] = rss(limit(128+c[i]), x[0]);
		}

		for (int i = 1; i < N; i++)
			for (int j = 0; j < M; j++)
				for(int k = 0; k < 256; k++)
					dp[limit(k + c[j])][i+1] = min( dp[k][i] + rss(limit(k+c[j]), x[i]) , dp[limit(k+c[j])][i+1]);

		int ans = 1 << 30;
		for (int i = 0; i < 256; i++)
			if (dp[i][N] < ans) ans = dp[i][N];
   

	cout << ans << endl;
 }
 
 //while (1){}
 return 0;
}