【codeforces 500C 】

Description
New Year is coming, and Jaehyun decided to read many books during 2015, unlike this year. He has n books numbered by integers from 1 to n. The weight of the i-th (1 ≤ i ≤ n) book is wi.

As Jaehyun’s house is not large enough to have a bookshelf, he keeps the n books by stacking them vertically. When he wants to read a certain book x, he follows the steps described below.

He lifts all the books above book x.
He pushes book x out of the stack.
He puts down the lifted books without changing their order.
After reading book x, he puts book x on the top of the stack.

He decided to read books for m days. In the j-th (1 ≤ j ≤ m) day, he will read the book that is numbered with integer bj (1 ≤ bj ≤ n). To read the book, he has to use the process described in the paragraph above. It is possible that he decides to re-read the same book several times.

After making this plan, he realized that the total weight of books he should lift during m days would be too heavy. So, he decided to change the order of the stacked books before the New Year comes, and minimize the total weight. You may assume that books can be stacked in any possible order. Note that book that he is going to read on certain step isn’t considered as lifted on that step. Can you help him?

Input
The first line contains two space-separated integers n (2 ≤ n ≤ 500) and m (1 ≤ m ≤ 1000) — the number of books, and the number of days for which Jaehyun would read books.

The second line contains n space-separated integers w1, w2, …, wn (1 ≤ wi ≤ 100) — the weight of each book.

The third line contains m space separated integers b1, b2, …, bm (1 ≤ bj ≤ n) — the order of books that he would read. Note that he can read the same book more than once.

Output
Print the minimum total weight of books he should lift, which can be achieved by rearranging the order of stacked books.

Sample Input
Input
3 5
1 2 3
1 3 2 3 1
Output
12
Hint
Here’s a picture depicting the example. Each vertical column presents the stacked books.

按照拿书顺序排好第一次序列，这已是最优解了，接下来的就无法掌控了，每拿一次书排一次序了

#include<cstdio>
#include<cstring>
using namespace std;
int ma[511],pa[1011],vis[511],st[511];
int main()
{
    int n,m,pl,ans = 0,kl,nl,i,j;
    scanf("%d%d",&n,&m);
    for(i = 1 ; i <= n ; i++)
        scanf("%d",&ma[i]);
    memset(vis,0,sizeof(vis));
    pl = 0;
    for(i = 1 ; i <= m ; i++)
    {
        scanf("%d",&pa[i]);
        if(vis[pa[i]] ==0)
        {
            st[++pl] = pa[i];
            vis[pa[i]] = 1;
        }
    }
    for(i = 2 ; i <= m ; i++)
    {
            for(j = 1 ; j <= pl ; j++)
            {
                if(pa[i] == st[j])
                    break;
                else
                ans += ma[st[j]];
            }
            nl = j;
            for(j = nl - 1 ; j >= 1 ; j--)
            st[j + 1] = st[j];
            st[1] = pa[i];
    }
    printf("%d\n",ans);
    return 0;
}