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>

using namespace std;
using ll = long long;

const ll mx = 1LL << 62;
ll dp[20002][256];

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

        if (n == 0 && m == 0) break;

        vector<int> c;
        vector<int> x;

        for (int i = 0; i < m; ++i) {
            int ci;
            cin >> ci;
            c.push_back(ci);
        }

        for (int i = 0; i < n; ++i) {
            int xi;
            cin >> xi;
            x.push_back(xi);
        }

        int y = 128;

        for (int i = 0; i <= n + 1; ++i) {
            for (int j = 0; j < 256; ++j) {
                dp[i][j] = -1;
            }
        }
        dp[0][128] = 0;
        
        for (int i = 0; i < n; ++i) {
            int next = x[i];
            for (int j = 0; j < m; ++j) {
                int cj = c[j];
                for (int k = 0; k < 256; ++k) {
                    if (dp[i][k] == -1) continue;
                    //int low = max(0, k - cj);
                    int high = min(255, k + cj);

                    //dp[i + 1][low] = min((dp[i+ 1][low] == -1 ? mx : dp[i+ 1][low]), dp[i][k] + (low - next) * (low - next));
                    dp[i + 1][high] = min((dp[i+ 1][high] == -1 ? mx : dp[i+ 1][high]), dp[i][k] + (high - next) * (high - next));
                }
            }
            // for (int k = 128; k < 256; ++k) {
            //     cout << dp[i + 1][k] << " ";
            // }
            //cout << endl;
        }

        ll mincost = mx;
        for (int i = 0; i < 256; ++i) {
            if (dp[n][i] < mincost && dp[n][i] != -1) mincost = dp[n][i];
        }
        cout << mincost << endl;

    }
}

C++: #include <algorithm>
#include <iostream>
#define N 20000
#define M 256
#define INF (1e9)
using namespace std;
int n,m,c[N],x[N],y,d[N][M],ans;

int main(){
  
  while(1){
    cin>>n>>m;
    if(!n&&!m) break;
    for(int i=0;i<m;i++) cin>>c[i];
    for(int i=0;i<n;i++) cin>>x[i];
    for(int i=0;i<n;i++)
      for(int j=0;j<M;j++) d[i][j]=INF;
    y=128;
    for(int i=0;i<m;i++){
      int next=y+c[i];
      if(next>255) next=255;
      if(next<0) next=0;
      d[0][next]=(x[0]-(next))*(x[0]-(next));
    }
    for(int i=0;i<n-1;i++){
      for(int j=0;j<M;j++){
	if(d[i][j]==INF) continue;
	for(int k=0;k<m;k++){
	  int next=j+c[k];
	  if(next>255) next=255;
	  if(next<0) next=0;
	  d[i+1][next]=min(d[i+1][next],d[i][j]+(x[i+1]-(next))*(x[i+1]-(next)));
	}
      }
    }
    ans=INF;
    for(int i=0;i<M;i++) ans=min(ans,d[n-1][i]);
    cout<<ans<<endl;
  }
  return 0;
}

C++: #include<iostream>
#include<cstdlib>
using namespace std;

int main()
{
  int N,M,C[16],x[20002];
  long long DP[2][256];
  long long mi,a,b,y,ans;

  while(1){
    cin>>N>>M;
    if(N==0 && M==0)break;
    for(int i=0;i<M;i++)cin>>C[i];
    for(int i=1;i<N+1;i++)cin>>x[i];
    for(int i=0;i<256;i++)DP[0][i]=1000000000;
    DP[0][128]=0;
    for(int i=1;i<N+1;i++){
      for(int j=0;j<256;j++)DP[i%2][j]=1000000000;
      for(int j=0;j<256;j++){
	if(DP[(i-1)%2][j]!=1000000000){
	  for(int k=0;k<M;k++){
	    a=j+C[k];
	    if(a<0)a=0;
	    if(a>255)a=255;
	    b=DP[(i-1)%2][j]+(a-x[i])*(a-x[i]);
	    DP[i%2][a]=min(DP[i%2][a],b);
	  }
	}
      }
    }
    ans=1000000000;
    for(int i=0;i<256;i++)ans=min(ans,DP[N%2][i]);
    cout<<ans<<endl;
  }
  return 0;
}

C++: #include<iostream>
#include<algorithm>

using namespace std;
typedef long long ll;

ll c[16], x[20000];

ll dp[20001][256];

int main() {
	while (1) {
		int n, m;
		cin >> n >> m;
		if (n + m == 0)break;
		for (int i = 0; i < m; i++)cin >> c[i];
		for (int i = 0; i < n; i++)cin >> x[i];

		for (int i = 0; i < 21; i++)for (int j = 0; j < 256; j++)dp[i][j] = 1e18;
		dp[0][128] = 0;

		for (int i = 0; i < n; i++) {
			for (int j = 0; j <= 255; j++) {
				for (int k = 0; k < m; k++) {
					int nxt = 0;
					nxt = j + c[k];
					if (j + c[k] < 0)nxt = 0;
					if (j + c[k] > 255)nxt = 255;
					
					dp[i + 1][nxt] = min(dp[i + 1][nxt], dp[i][j] + (x[i] - nxt) * (x[i] - nxt));
				}
			}
		}
		ll ans = 1e18;

		for (int i = 0; i < 256; i++) {
			ans = min(ans, dp[n][i]);
		}
		cout << ans << endl;

	}

	return 0;
}