我不会区间dp。设\(f_{i,j}\)表示使得区间\([i,j]\)为回文串的最小操作代价，\(cost_{i,j}\)表示字母\(i\)删除/添加的耗费，那么显而易见的，我们有：\(f_{i,j}\to\min(f_{i,j-1}+\min(cost_{s_j,0},cost_{s_j,1}),f_{i+1,j}+\min(cost_{s_i,0},cost_{s_i,1}))\)。当\(s_i

地址https://www.papamelon.com/problem/308给定一个长度为m(m≤2000)的小写字母字符串,在给定组成该字符串的n(n≤26)个字符的添加和删除费用,求使原字符串变为

Thereare n citiesconnectedbysomenumberofflights.Youaregivenanarray flights where flights[i]=[fromi,toi,pricei] indicatesthatthereisa

#include<bits/stdc++.h>usingnamespacestd;classsolve{ public: intn,m; map<char,int>Map,Maps; chars[2222]; intf[2222][2222]; voidmain()