链接链接
题意:给 n 个字符串,对每个字符串可以翻转,有固定翻转费用。问最后从 1 ~ n 使字符串字典序递增的最小费用。
思路:dp[i][k (0 / 1)] ,表示前 i 个有序,i 位置以 0 (表示 i 字符串不翻转),1(表示 i 字符串翻转)的最小费用。
每一次都比较当前位置与上一个要使用的状态的字典序.
故有状态转移方程: (str 表示当前串,restr 表示翻转串)
if(str[i] >= str[i - 1]) dp[i][0] = dp[i - 1][0];
if(str[i] >= restr[i - 1]) dp[i][0] = min(dp[i][0],dp[i - 1][1]);
if(restr[i] >= str[i - 1]) dp[i][1] = dp[i - 1][0] + c[i];
if(restr[i] >= restr[i - 1]) dp[i][1] = min(dp[i][1],dp[i - 1][1] + c[i]);
Code:
#include<bits/stdc++.h>
#define debug(x) cout << "[" << #x <<": " << (x) <<"]"<< endl
#define pii pair<int,int>
#define clr(a,b) memset((a),b,sizeof(a))
#define rep(i,a,b) for(int i = a;i < b;i ++)
#define pb push_back
#define MP make_pair
#define LL long long
#define ull unsigned LL
#define ls i << 1
#define rs (i << 1) + 1
#define fir first
#define sec second
#define CLR(a) while(!(a).empty()) a.pop()
using namespace std;
const int maxn = 1e5 + 10;
const LL inf = 0x3f3f3f3f3f3f3f3f;
string str[maxn],restr[maxn];
LL c[maxn];
LL dp[maxn][2]; ///0表示不翻转
int main() {
int n;
while(~scanf("%d",&n)){
for(int i = 1;i <= n;++ i)
scanf("%lld",&c[i]);
for(int i = 1;i <= n;++ i){
cin >> str[i];
restr[i] = "";
int len = str[i].size();
for(int j = 0;j < len;++ j)
restr[i] += str[i][len - j - 1];
}
clr(dp,inf);
dp[1][0] = 0;
dp[1][1] = c[1];
for(int i = 2;i <= n;++ i){
if(str[i] >= str[i - 1])
dp[i][0] = dp[i - 1][0];
if(str[i] >= restr[i - 1])
dp[i][0] = min(dp[i][0],dp[i - 1][1]);
if(restr[i] >= str[i - 1])
dp[i][1] = dp[i - 1][0] + c[i];
if(restr[i] >= restr[i - 1])
dp[i][1] = min(dp[i][1],dp[i - 1][1] + c[i]);
}
if(dp[n][0] >= inf && dp[n][1] >= inf)
printf("-1\n");
else printf("%lld\n",dp[n][0] > dp[n][1] ? dp[n][1] : dp[n][0]);
}
return 0;
}