Jun 15 training 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
inputCopy
2
1 2
ba
ac
outputCopy
1
inputCopy
3
1 3 1
aa
ba
ac
outputCopy
1
inputCopy
2
5 5
bbb
aaa
outputCopy
-1
inputCopy
2
3 3
aaa
aa
outputCopy
-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 “aa” should go before string “aaa”, thus the answer is  - 1.
/*
题目大意：给定若干个字符串，
可以操作若干次即把字符串反转，
但位置始终不变，问要把这些字符串
弄成按字母序递增的（相等的也可以）
序列需要至少多少次反转操作。

明显的DP，用二维状态维护，
(i,j)表示到第i个位置，用j中方式得到第i位置的字符串并维护出递增
的最小次数，转移方程很明显，
详见代码~
时间复杂度：O(n)。
*/

#include<bits/stdc++.h>
typedef long long ll;
typedef double db;
const ll mod = 1e9+7;
const int N = 1e5 + 20;
#define dep(i,a,b) for(int i=(a);i>=(b);i–)
#define rep(i,a,b) for(int i=(a);i<=(b);i++)
#define mes§ memset(p,0,sizeof§)
#define mst(a,b) memset((a),(b),sizeof(a))
using namespace std;//reverse(s.begin(),s.end()); //19:40
int main()
{
ll n,dp[N][2],a[N];//d[x][1]表示在此处反转，d[x][0]表示不反转
cin>>n;
rep(i,1,n)
cin>>a[i];
string bef,rbef,now,rnow;//rbef表示bef的翻转
cin>>bef;rbef=bef;reverse(rbef.begin(),rbef.end());
mst(dp,0xf);//将dp中的每个数都变很大
dp[1][0]=0;dp[1][1]=a[1];
ll INF=dp[2][0];
rep(i,2,n){
cin>>now;rnow=now;reverse(rnow.begin(),rnow.end());
if(bef<=now) dp[i][0]=dp[i-1][0];
if(rbef<=now) dp[i][0]=min(dp[i][0],dp[i-1][1]);
if(bef<=rnow) dp[i][1]=dp[i-1][0]+a[i];
if(rbef<=rnow) dp[i][1]=min(dp[i][1],dp[i-1][1]+a[i]);
rbef=bef=now;reverse(rbef.begin(),rbef.end());
}
if(min(dp[n][0],dp[n][1])!=INF)
cout<<min(dp[n][0],dp[n][1]);
else
cout<<"-1";
return 0;
}