划分凸多边形 区间DP + 高精度运算

思路

• 对于每个三角形， 我们的len从3开始枚举， f[l, r]代表区间[l, r]的最小值， 然后我们就从一般的区间DP角度去做， 就可以得到样例的结果

#include <iostream>
#include <cstring>
#include <algorithm>

using namespace std;

const int N = 100, inf = 0x3f3f3f3f;

int n;
int f[N][N], w[N];

int main()
{
	cin >> n;
	for(int i = 1; i <= n; i++)
		cin >> w[i];
	
	for(int len= 3; len <= n; len++)
		for(int l = 1; l + len - 1 <= n; l++)
		{
			int r = l + len - 1;
			f[l][r] = inf;
			for(int k = l + 1; k < r; k++)
				f[l][r] = min(f[l][r], f[l][k] + f[k][r] + w[l] * w[r] * w[k]);
		}
		
	cout << f[1][n] << endl;
	return 0;
 } 

• 但是由于数据会超long long 所以， 我们改用高精度运算

#include <iostream>
#include <cstring>
#include <algorithm>
#include <vector>
using namespace std;

const int N = 100, inf = 0x3f3f3f3f;
typedef long long ll;

int n;
vector<ll> f[N][N];
int w[N];

vector<ll> add(vector<ll> &A, vector<ll> &B)
{
    vector<ll> C;
    ll 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;
    }
    
    if(t) C.push_back(1);
    return C;
}

vector<ll> mul(vector<ll> &A, ll b)
{
    vector<ll> 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;
}

void print(vector<ll> A)
{
    if(A.empty())
    {
        cout << "空的" << endl;
        return;
    }
    int i = A.size() - 1;
	while(i && !A[i]) i--;
	for(i; i >= 0; i--)
		cout << A[i];
		cout << endl;
}

bool cmp(vector<ll> A, vector<ll> B)
{
   // cout << A.size() << " ";
    //cout << "A == ";
   // print(A);
   // cout << B.size() << " ";
   // cout << "B == ";
   // print(B);
	if(A.empty())	return true;
	if(A.size() > B.size()) return true;
	if(A.size() < B.size()) return false;
	for(int i = A.size() - 1; i >= 0; i--)
	{
	  // cout <<  "A[i] = " << A[i] << " B[i] = " << B[i] <<endl;
	    if(A[i] > B[i])
			return true;
		if(A[i] < B[i])
		    return false;
	}
		
	return false;
}
int main()
{
	cin >> n;
	for(int i = 1; i <= n; i++)
		cin >> w[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++)
			{
				vector<ll> tem;
				tem.push_back(1);
				tem = mul(tem, w[l]);
				tem = mul(tem, w[r]);
				tem = mul(tem, w[k]);
				tem = add(tem, f[k][r]);
				tem = add(tem, f[l][k]);
				
			//	cout << "tem.back = " << tem.back() <<endl;
				if(cmp(f[l][r], tem))
				{
				    //print(f[l][r]);
				   // print(tem);
				    
					f[l][r].clear();
					for(int g = 0; g < tem.size() ; g++)
					{
					   	f[l][r].push_back(tem[g]);
					   	
					}
					//print(f[l][r]);
				//	cout << endl ;
				}	
			}
		}
		
	int i = f[1][n].size() - 1;
	while(i && !f[1][n][i]) i--;

	for(i; i >= 0; i--)
		cout << f[1][n][i];
		cout << endl;
	return 0;
 }