音乐研究

暴力求解

#include <iostream>
 #include <vector>
 #include <math.h>
 using namespace std;

 int GetMinDiff(const vector<int>& sub, const vector<int>& lng)
 {
     int len1 = sub.size( ) ;
     int len2 = lng.size( ) ;
     if(len1 > len2) return -1;

     int min = 0x7fffffff, curDiff = 0;
     for(int i=0; i < len2-len1; ++i){
         int k = i;
         curDiff = 0;
         for(int j = 0; j< len1; ++j){
             int dif = abs(sub[j]-lng[k++]);
             curDiff += (int)pow((double)dif, (double)2);
         }
         if(min > curDiff){
             min = curDiff;
         }
     }
     return min;
 }

 int main( )
 {
     int n,m;
     while( cin>>n){
         vector<int> v1(n, 0);
         for(int i=0; i< n; ++i)
             cin>>v1[i];

         cin>>m;
         vector<int> v2(m, 0);
         for(int i=0; i< m; ++i)
             cin>>v2[i];
         cout<<GetMinDiff(v1, v2)<<endl;
     }
     return 0;
 }

import java.util.Scanner;

public class Main {
	public static int getDifference(int a[], int b[]) {
		int min = Integer.MAX_VALUE;
		int aLen = a.length;
		for (int i = 0; i <= b.length-aLen; i++) {
			int k = i;
			int difference = 0;
			for (int j = 0; j < aLen; j++) {
				int temp = a[j] - b[k];
				difference += temp * temp;
				if (difference > min)// 过滤掉不必要的执行
					break;
				k++;
				if (j == aLen - 1) {
					if (difference == 0)
						return 0;
					if (difference < min)
						min = difference;
				}
			}
		}
		return min;
	}

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		int[] a = new int[n];
		for (int i = 0; i < n; i++)
			a[i] = sc.nextInt();
		int m = sc.nextInt();
		int[] b = new int[m];
		for (int i = 0; i < m; i++)
			b[i] = sc.nextInt();
		System.out.println(getDifference(a, b));
	}
}

def diff(a,b):
    res=[]
    for i in range(len(a)):
        res.append((a[i]-b[i])**2)
    return sum(res)
while True:
    try:
        n=input()
        if len(n)==0:
            break
        n=int(n)
        s1=list(map(int,input().split()))
        m=int(input())
        s2=list(map(int,input().split()))
        res=[]
        for i in range(m-n+1):
            c=[]    #c保存第二个列表中所有与第一个列表等长的子列表
            for j in range(n):
                c.append(s2[i+j])
            res.append(diff(s1,c))
        print(min(res))
    except:
        break
        

#include<iostream>
#include<vector>

using namespace std;
int main(){
	int n,m,dif,d=0,sum=0;
	while(cin>>n){
	vector<int> a(n,0);
	for(int i=0;i<n;i++)
		cin>>a[i];
	cin>>m;
	vector<int> b(m,0);
	for(int i=0;i<m;i++)
		cin>>b[i];
	if(m>=n)
		dif=m-n;
	for(int i=0;i<dif;i++){
		sum=0;
		for(int j=0;j<n;j++){
			sum+=(a[j]-b[i+j])*(a[j]-b[i+j]);
			}
		if(i==0)d=sum;
		if(sum<d)
			d=sum;
		}
	cout<<d<<endl;
	}
	//system("pause");
	return 0;
}