这一题O(n2)竟然能过!
提交记录
AC code:
#include<bits/stdc++.h>
using namespace std;
int a[33000];
int main(){
int n;
cin >> n;
int sum = 0;
for(int i=1;i<=n;i++){
cin >> a[i];
}
for(int i=1;i<=n;i++){
int minn = 0x3f3f3f3f;
if(i == 1){
minn = a[i];
}else{
for(int j=1;j<i;j++){
minn=min(minn,abs(a[j]-a[i]));
}
}
sum += minn;
}
cout <<sum << endl;
return 0;
}