제출 #582817

#제출 시각아이디문제언어결과실행 시간메모리
582817600MihneaBuilding Bridges (CEOI17_building)C++17
30 / 100
3071 ms4796 KiB
#include <bits/stdc++.h> using namespace std; typedef long long ll; const int N = (int) 1e5 + 7; const ll INF = (ll) 1e18 + 7; int n; ll h[N]; ll sum[N]; ll dp[N]; pair<ll, ll> coef[N]; signed main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); cin >> n; for (int i = 1; i <= n; i++) { int x; cin >> x; h[i] = x; } for (int i = 1; i <= n; i++) { int x; cin >> x; sum[i] = sum[i - 1] + x; } dp[1] = 0; for (int i = 2; i <= n; i++) { dp[i] = INF; } for (int r = 2; r <= n; r++) { coef[r - 1] = {dp[r - 1] + h[r - 1] * h[r - 1] - sum[r - 1], - 2 * h[r - 1]}; for (int l = 1; l < r; l++) { dp[r] = min(dp[r], coef[l].first + coef[l].second * h[r]); } dp[r] += h[r] * h[r] + sum[r - 1]; } cout << dp[n] << "\n"; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...