题目
题解思路
参考这个图形,即我们可以通过两个边来确定图形的形状。
dp的题解真的很难写 ,可能时我的理解还不到位,看大佬的题解吧。
参考彩签大佬的题解
这题样例就爆longlong了。所以得高精或者int128
主要是为了贴个高精模板
AC代码
#include <bits/stdc++.h>
//#include <unordered_map>
//priority_queue
#define PII pair<int,int>
#define LL long long
using namespace std;
const int INF = 0x3f3f3f3f;
const int N = 200100;
int n ;
int a[110] ;
vector <int> dp[110][110] ;
bool cmp(vector<int> &a, vector<int> &b)
{
if (a.size() != b.size()) return a.size() < b.size();
for (int i = a.size() - 1; i >= 0; i -- )
if (a[i] != b[i])
return a[i] < b[i];
return true;
}
vector<int> add(vector<int> a, vector<int> b)
{
vector<int> c;
int t = 0;
for (int i = 0; i < a.size() || i < b.size(); i ++ )
{
if (i < a.size()) t += a[i];
if (i < b.size()) t += b[i];
c.push_back(t % 10);
t /= 10;
}
while (t) c.push_back(t % 10), t /= 10;
return c;
}
vector<int> mul(vector<int> a, LL b)
{
vector<int> c;
LL t = 0;
for (int i = 0; i < a.size(); i ++ )
{
t += b * a[i];
c.push_back(t % 10);
t /= 10;
}
while (t) c.push_back(t % 10), t /= 10;
return c;
}
int main()
{
ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
cin >> n ;
for (int i = 1 ; i <= n ; i++ )
cin >> a[i] ;
for (int len = 3 ; len <= n ; len++ )
for (int l = 1 ; l + len - 1 <= n ; l++ )
{
int r = l + len - 1 ;
for (int k = l + 1 ; k < r ; k++ )
{
auto val = mul(mul({a[l]},a[k]),a[r]) ;
val = add(add(val,dp[l][k]),dp[k][r]) ;
if ( dp[l][r].empty()||cmp(val,dp[l][r]))
dp[l][r] = val ;
}
}
auto res = dp[1][n] ;
for ( int i = res.size() - 1 ; i >= 0 ; i-- )
cout << res[i];
cout << "\n" ;
return 0 ;
}