C. Hard problem

http://codeforces.com/problemset/problem/706/C

题意：给出每个串反转的花费，问最小花费使得这些串按字典序排序；

思路：dp；dp[i][0/1] 表示的i个串反转（1）还不反转（0）的最小花费；

#include<algorithm>
#include<set>
#include<vector>
#include<queue>
#include<cmath>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<set>
#include<vector>
#include<queue>
#include<cmath>
#include<cstring>
#include<sstream>
#include<cstdio>
#include<ctime>
#include<map>
#include<stack>
#include<string>
using namespace std;

#define sfi(i) scanf("%d",&i)
#define pri(i) printf("%d\n",i)
#define sff(i) scanf("%lf",&i)
#define ll long long
#define mem(x,y) memset(x,y,sizeof(x))
#define INF 0x3f3f3f3f
#define eps 1e-6
#define PI acos(-1)
#define lowbit(x) ((x)&(-x))
#define zero(x) (((x)>0?(x):-(x))<eps)
#define fl() printf("flag\n")
ll gcd(ll a,ll b){while(b^=a^=b^=a%=b);return a;}
const int maxn=1e5+9;
const int mod=9973;

template <class T>
inline void sc(T &ret)
{
    char c;
    ret = 0;
    while ((c = getchar()) < '0' || c > '9');
    while (c >= '0' && c <= '9')
    {
        ret = ret * 10 + (c - '0'), c = getchar();
    }
}

ll power(ll x,ll n)
{
    ll ans=1;
    while(n)
    {
        if(n&1) ans=ans*x;
        x=x*x;
        n>>=1;
    }
    return ans;
}

string s[maxn],t[maxn];
ll c[maxn],dp[maxn][2];
int main()
{
    int n;
    cin>>n;
    for(int i=1;i<=n;i++)
    {
        cin>>c[i];
        dp[i][0]=dp[i][1]=2e18;
    }
    for(int i=1;i<=n;i++)
    {
        cin>>s[i];
        t[i]=s[i];
        reverse(t[i].begin(),t[i].end());
    }

    dp[1][0]=0;
    dp[1][1]=c[1];
    for(int i=2;i<=n;i++)
    {
        if(s[i]>=s[i-1])
        {
            dp[i][0]=dp[i-1][0];
        }
        if(s[i]>=t[i-1])
        {
            dp[i][0]=min(dp[i][0],dp[i-1][1]);
        }
        if(t[i]>=s[i-1])
        {
            dp[i][1]=min(dp[i][1],dp[i-1][0]+c[i]);
        }
        if(t[i]>=t[i-1])
        {
            dp[i][1]=min(dp[i][1],dp[i-1][1]+c[i]);
        }
        //cout<<dp[i][0]<<" "<<dp[i][1]<<endl;
    }
    if(dp[n][1]!=2e18||dp[n][0]!=2e18)
        cout<<min(dp[n][0],dp[n][1])<<endl;
    else cout<<-1<<endl;
    return 0;
}