#include<bits/stdc++.h>
using namespace std;
#define ll long long
ll n,h[100005],w[100005],qs[100005],dp[100005];
ll query(ll l,ll r)
{
if(l>r)return 0;
return qs[r]-qs[l-1];
}
int main()
{
ios_base::sync_with_stdio(0),cin.tie(0);
cin >> n;
for(int i=1;i<=n;i++)cin >> h[i],dp[i]=1e18;
for(int i=1;i<=n;i++)cin >> w[i],qs[i]=qs[i-1]+w[i];
dp[1]=0;
for(int i=2;i<=n;i++)
{
for(int j=1;j<i;j++)
{
dp[i]=min(dp[i],dp[j]+query(j+1,i-1)+(h[i]-h[j])*(h[i]-h[j]));
}
}
printf("%lld\n",dp[n]);
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
336 KB |
Output is correct |
2 |
Correct |
1 ms |
340 KB |
Output is correct |
3 |
Correct |
1 ms |
340 KB |
Output is correct |
4 |
Correct |
1 ms |
340 KB |
Output is correct |
5 |
Correct |
2 ms |
340 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Execution timed out |
3088 ms |
4436 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
336 KB |
Output is correct |
2 |
Correct |
1 ms |
340 KB |
Output is correct |
3 |
Correct |
1 ms |
340 KB |
Output is correct |
4 |
Correct |
1 ms |
340 KB |
Output is correct |
5 |
Correct |
2 ms |
340 KB |
Output is correct |
6 |
Execution timed out |
3088 ms |
4436 KB |
Time limit exceeded |
7 |
Halted |
0 ms |
0 KB |
- |