Submission #124183

#TimeUsernameProblemLanguageResultExecution timeMemory
124183mechfrog88Safety (NOI18_safety)C++11
7 / 100
5 ms632 KiB
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef long double ld;	


int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	int n,a;
	cin >> n >> a;
	if (n <= 14){
		vector <ll> arr(n+1,0);
		ll maxi = 0;
		for (int z=1;z<=n;z++){
			cin >> arr[z];
			maxi = max(maxi,arr[z]);
		}
		vector <vector<ll>> dp(n+1,vector<ll>(maxi+1,0));
		for (ll z=1;z<=n;z++){
			for (ll h=0;h<=maxi;h++){
				ll mini = LLONG_MAX;
				for (ll x=max(ll(0),h-a);x<=min(maxi,h+a);x++){
					mini = min(mini,dp[z-1][x]);
				}
				dp[z][h] = mini+abs(arr[z]-h);
			}
		}
		ll mini = LLONG_MAX;
		for(ll z=0;z<=maxi;z++){
	
				mini = min(dp[n][z],mini);
			}
		cout << mini << endl;
	} else {
		cout << 1 << endl;
	}

}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...