CF706C Hard problem（dp）

Hard problem

题意：给定n个字符串，每个字符串翻转需要花费一定的费用，要使所有字符串呈字典序输出（即：s1<=s2。。。。。）且花费最少

分析：
1.显然线性dp
2.f(i,0) 为第i个不翻转，前i个达成字典序的最小费用；f(i,1) 为第1个翻转，前i个达成字典序的最小费用
3.分四种情况更新dp，第i-1个字符串和第i个字符串分别翻或不翻
4.注意费用较大会爆int

Code：

#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<int, int>
#define mem(a, b) memset(a, b, sizeof(a));
#define lowbit(x) (x & -x)
#define lrt nl, nr, rt << 1
#define rrt nl, nr, rt << 1 | 1
template <typename T>
inline void read(T& t) {
    t = 0;
    int f = 1;
    char ch = getchar();
    while (!isdigit(ch)) {
        if (ch == '-')
            f = -1;
        ch = getchar();
    }
    while (isdigit(ch)) {
        t = t * 10 + ch - '0';
        ch = getchar();
    }
    t *= f;
}
const int dx[] = {0, 1, 0, -1};
const int dy[] = {1, 0, -1, 0};
const ll Inf = 0x7f7f7f7f7f7f;
const int inf = 0x3f3f3f3f;
const int maxn = 1e5 + 5;

ll an[maxn];
ll dp[maxn][2];
string ss[maxn];

int main(void) {
    int n;
    read(n);
    for (int i = 1; i <= n; i++)
        read(an[i]);
    for (int i = 1; i <= n; i++)
        cin >> ss[i];
    for (int i = 2; i <= n; i++)
        dp[i][0] = dp[i][1] = Inf;
    dp[1][1] = an[1];
    for (int i = 2; i <= n; i++) {
        string s1 = ss[i - 1];
        string s2 = ss[i];
        if (s2 >= s1)
            dp[i][0] = min(dp[i][0], dp[i - 1][0]); //都不翻
        reverse(s1.begin(), s1.end());
        if (s2 >= s1)
            dp[i][0] = min(dp[i][0], dp[i - 1][1]); //前翻后不翻
        reverse(s1.begin(), s1.end());
        reverse(s2.begin(), s2.end());
        if (s2 >= s1)
            dp[i][1] = min(dp[i][1], dp[i - 1][0] + an[i]); //后翻前不翻
        reverse(s1.begin(), s1.end());
        if (s2 >= s1)
            dp[i][1] = min(dp[i][1], dp[i - 1][1] + an[i]); //都翻转
    }
    ll ans = min(dp[n][0], dp[n][1]);
    printf("%lld\n", ans == Inf ? -1 : ans);
    return 0;
}