Codeforces Round #367 (Div. 2) C. Hard problem（简单DP）

C. Hard problem
time limit per test1 second
memory limit per test256 megabytes
inputstandard input
outputstandard output
Vasiliy is fond of solving different tasks. Today he found one he wasn’t able to solve himself, so he asks you to help.

Vasiliy is given n strings consisting of lowercase English letters. He wants them to be sorted in lexicographical order (as in the dictionary), but he is not allowed to swap any of them. The only operation he is allowed to do is to reverse any of them (first character becomes last, second becomes one before last and so on).

To reverse the i-th string Vasiliy has to spent ci units of energy. He is interested in the minimum amount of energy he has to spent in order to have strings sorted in lexicographical order.

String A is lexicographically smaller than string B if it is shorter than B (|A| < |B|) and is its prefix, or if none of them is a prefix of the other and at the first position where they differ character in A is smaller than the character in B.

For the purpose of this problem, two equal strings nearby do not break the condition of sequence being sorted lexicographically.

Input
The first line of the input contains a single integer n (2 ≤ n ≤ 100 000) — the number of strings.

The second line contains n integers ci (0 ≤ ci ≤ 109), the i-th of them is equal to the amount of energy Vasiliy has to spent in order to reverse the i-th string.

Then follow n lines, each containing a string consisting of lowercase English letters. The total length of these strings doesn’t exceed 100 000.

Output
If it is impossible to reverse some of the strings such that they will be located in lexicographical order, print  - 1. Otherwise, print the minimum total amount of energy Vasiliy has to spent.

Examples
input
2
1 2
ba
ac
output
1
input
3
1 3 1
aa
ba
ac
output
1
input
2
5 5
bbb
aaa
output
-1
input
2
3 3
aaa
aa
output
-1
Note
In the second sample one has to reverse string 2 or string 3. To amount of energy required to reverse the string 3 is smaller.

In the third sample, both strings do not change after reverse and they go in the wrong order, so the answer is  - 1.

In the fourth sample, both strings consists of characters ‘a’ only, but in the sorted order string

题意：有N个字符串，可以消耗ci的能量翻转操作第i个字符串，消耗最少的能量操作后使得N个字符串按照字典序排列。

思路：翻转每个字符串所需能量存入数组num，DP数组初始化为正无穷。
DP[0/1][i]表示当前第i个字符串不翻转/翻转，前i个字符串有序需要付出的最小能量。

状态转移：
如果当前字符串不翻转字典序大于前一个不翻转字符串 DP[0][i]=min(DP[0][i],DP[0][i-1])
如果当前字符串不翻转字典序大于前一个翻转字符串 DP[0][i]=min(DP[0][i],DP[1][i-1])
如果当前字符串翻转字典序大于前一个不翻转字符串 DP[1][i]=min(DP[1][i],DP[0][i-1]+num[i])
如果当前字符串翻转字典序大于前一个翻转字符串DP[1][i]=min(DP[1][i],DP[1][i-1]+num[i])

坑点：DP数组用long long，正无穷建议设置为pow(2,60)

代码

#include<stdio.h>
#include<iostream>
#include<algorithm>
#include<string.h>
#include<queue>
#include<math.h>
#include<string>
using namespace std;
const int maxn=100005;
const long long int INF=pow(2,62);
long long int num[maxn];//翻转第i个字符串num[i]能量
long long int DP[2][maxn];
string str[2][maxn];
int main()
{
    int N;
    scanf("%d",&N);
    for(int i=1; i<=N; i++)
    {
        scanf("%I64d",&num[i]);
    }
    for(int i=1; i<=N; i++)
    {
        cin>>str[0][i];
        str[1][i]=str[0][i];
        reverse(str[1][i].begin(),str[1][i].end());
    }
    for(int i=1;i<=N;i++)
    {
        DP[0][i]=INF;
        DP[1][i]=INF;
        if(str[0][i]>=str[0][i-1])
        {
            DP[0][i]=min(DP[0][i],DP[0][i-1]);
        }
        if(str[0][i]>=str[1][i-1])
        {
            DP[0][i]=min(DP[0][i],DP[1][i-1]);
        }
        if(str[1][i]>=str[0][i-1])
        {
            DP[1][i]=min(DP[1][i],DP[0][i-1]+num[i]);
        }
        if(str[1][i]>=str[1][i-1])
        {
            DP[1][i]=min(DP[1][i],DP[1][i-1]+num[i]);
        }
    }
    DP[0][N]==INF&&DP[1][N]==INF?printf("-1\n"):printf("%I64d\n",min(DP[0][N],DP[1][N]));
    return 0;
}