Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <bits/stdc++.h>
- using namespace std;
- const long long INF=1e18;
- long long dp[1001];
- long long pow(long long i){
- return i*i;
- }
- int main(){
- int n,k;
- scanf("%d%d",&n,&k);
- long long ar[n+1];
- for(int i=1;i<=n;i++){
- scanf("%lld",&ar[i]);
- dp[i]=INF;
- }
- long long mn=INF;
- for(int i=n;i>=1;i--){
- for(int j=i;j<=n;j++){
- if(j+1>n) dp[i]=min(dp[i],k+pow(ar[i]-ar[j]));
- else dp[i]=min(dp[i],k+pow(ar[i]-ar[j])+dp[j+1] );
- }
- }
- printf("%lld",dp[1]);
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement