#include <bits/stdc++.h>
using namespace std;
#define forw(i,a,b) for(ll i=a;i<=b;i++)
#define forb(i,a,b) for(ll i=a;i>=b;i--)
typedef long long int ll;
ll res,n,h[100005],w[100005],max1[100005],pre[100005],dp[100005];
void sub1()
{
for (int i=2;i<=n;i++)
{
max1[i]=1e18;
res=0;
for (int j=i-1;j>=1;j--)
{
ll p=(h[i]-h[j])*(h[i]-h[j])+res+max1[j];
if (p<max1[i]) max1[i]=p;
res+=w[j];
}
}
cout<<max1[n];
}
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
//freopen("test.INP","r",stdin);
//freopen("test.OUT","w",stdout);
cin>>n;
for (int i=1;i<=n;i++)
cin>>h[i];
for (int i=1;i<=n;i++)
cin>>w[i];
sub1();
//else sub2();
//sub2();
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
332 KB |
Output is correct |
2 |
Correct |
0 ms |
332 KB |
Output is correct |
3 |
Correct |
0 ms |
332 KB |
Output is correct |
4 |
Correct |
1 ms |
332 KB |
Output is correct |
5 |
Correct |
2 ms |
332 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Execution timed out |
3063 ms |
2588 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
332 KB |
Output is correct |
2 |
Correct |
0 ms |
332 KB |
Output is correct |
3 |
Correct |
0 ms |
332 KB |
Output is correct |
4 |
Correct |
1 ms |
332 KB |
Output is correct |
5 |
Correct |
2 ms |
332 KB |
Output is correct |
6 |
Execution timed out |
3063 ms |
2588 KB |
Time limit exceeded |
7 |
Halted |
0 ms |
0 KB |
- |