Submission #2302501

---

Source Code Expand

#include<deque>
#include<queue>
#include<vector>
#include<algorithm>
#include<iostream>
#include<set>
#include<cmath>
#include<tuple>
#include<string>
#include<chrono>
#include<functional>
#include<iterator>
#include<random>
#include<unordered_set>
#include<array>
#include<map>
#include<iomanip>
using namespace std;
typedef long long int llint;
typedef long double lldo;
#define mp make_pair
#define mt make_tuple
#define pub push_back
#define puf push_front
#define pob pop_back
#define pof pop_front
#define fir first
#define sec second
#define res resize
#define ins insert
#define era erase
//cout<<setprecision(20)
const llint mod=1000000007;
const llint big=1e17+10;
const long double pai=3.141592653589793238462643383279502884197;
const long double eps=1e-9;
template <class T,class U>void mineq(T& a,U b){if(a>b){a=b;}}
template <class T,class U>void maxeq(T& a,U b){if(a<b){a=b;}}
llint gcd(llint a,llint b){if(a%b==0){return b;}else return gcd(b,a%b);}
llint lcm(llint a,llint b){return a/gcd(a,b)*b;}
template<class T> void SO(T& ve){sort(ve.begin(),ve.end());}
template<class T> void REV(T& ve){reverse(ve.begin(),ve.end());}
int LBI(vector<int>&ar,int in){return lower_bound(ar.begin(),ar.end(),in)-ar.begin();}
int UBI(vector<int>&ar,int in){return upper_bound(ar.begin(),ar.end(),in)-ar.begin();}
int main(void){
	int n,i,j;cin>>n;
	string s;cin>>s;
	int sai=0;
	static bool can[5001][5001]={};
	for(j=0;j<n;j++){can[j][j+1]=true;can[j][j]=true;}
	can[n][n]=true;
	for(i=2;i<=n;i++){//iは長さ
		for(j=0;j+i<=n;j++){
			if(!can[j+1][j+i-1]){continue;}
			can[j][j+i]=(s[j]==s[j+i-1]);
		}
	}
	vector<llint>dp(n+1,big);dp[0]=0;
	vector<llint>cost(n+1);
	for(i=1;i<=n;i++){cin>>cost[i];}
	for(i=0;i<n;i++){
		for(j=i+1;j<=n;j++){
			if(!can[i][j]){continue;}
			mineq(dp[j],dp[i]+cost[j-i]);
		}
	}
	cout<<dp[n]<<endl;
	return 0;
}

Submission Info

Judge Result