动态网站源码/搜索推广和信息流推广的区别

https://www.luogu.org/problem/show?pid=3650
贪心.
方法：枚举山的高度作为最低点,把把山全部转移到这个范围内的花费记下来，不断求最小值。

#include<iostream>
#include<cstdio>
#include<cstring>
#include<vector>
#include<algorithm>
#include<cmath> 
#define LL long long 
using namespace std;
LL ans=0,minn=10000000,n;
int a[1002];
int main()
{scanf("%d",&n);for(int i=1;i<=n;i++)scanf("%d",&a[i]);for(int i=0;i<=84;i++){ans=0;for(int j=1;j<=n;j++){if(a[j]<i) ans+=(a[j]-i)*(a[j]-i);if(a[j]>i+17) ans+=(a[j]-i-17)*(a[j]-i-17); }minn=min(minn,ans); }printf("%lld\n",minn);return 0;
}