枚举其所有可能区间即可
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
vector<int>res;
for(int i=0;i<n;i++){
int key;
cin>>key;
res.push_back(key);
}
int sum=0;
int min=INT_MAX;
for(int i=0;i<=83;i++){
int left=i;
int right=i+17;
for(vector<int>::iterator it=res.begin();it!=res.end();it++){
if(*it<left) sum=sum+(left-*it)*(left-*it);
else if(*it>right)sum=sum+(right-*it)*(right-*it);
}
if(min>sum)min=sum;
sum=0;
}
cout<< min<<endl;
return 0;
}