CodeForces_500C

New Year Book Reading

    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.

1. He lifts all the books above book x.
2. He pushes book x out of the stack.
3. He puts down the lifted books without changing their order.
4. 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.

Example
Input
3 5
1 2 3
1 3 2 3 1
Output

12

Note
    Here's a picture depicting the example. Each vertical column presents the stacked books.

题目大意

    某人有n（2<=n<=500）本书摞成一摞，编号从1~n。

    编号为i的书的重量为w(i)（1<=w(i)<=100）。

    m（1<=m<=1000）天内每天看一本（同一本书可以重复看）。

    每次看书时，把该书以上的书抬起来，取出目标书以后再放下，看完后该书就放在了最顶端。

    输入n，m，w(1)~w(n)以及每天看的书的编号。

    求m天内抬起的书的总重量（不包括当天要看的书）最小值是多少。（书的初始顺序任意）。

解题思路

    将m天内看过的书按照其编号第一次出现时的先后顺序，从顶端向下排序。

    再模拟m天看书的过程，计算出的重量即为最小的答案。

Code

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>

using namespace std;

const int INF = 0x3f3f3f3f;
const int MAX_N = 500 + 2;

int weight[MAX_N];
int pos[MAX_N];
bool vis[MAX_N];
int num[MAX_N*2];

int main()
{
	int n, m;
	while(scanf("%d%d", &n, &m) != EOF)
	{
		for(int i=1; i<=n; i++)
			scanf("%d", &weight[i]);

		memset(vis, false, sizeof(vis));
		for(int i=1, k=1; i<=m; i++)
		{
			scanf("%d", &num[i]);
			if(!vis[num[i]])
			{
				vis[num[i]] = true;
				pos[num[i]] = k++;
			}
		}

		int ans = 0;
		for(int i=1; i<=m; i++)
		{
			for(int j=1; j<=n; j++)
				if(vis[j] && pos[j]<pos[num[i]])
				{
					pos[j]++;
					ans += weight[j];
				}
			pos[num[i]] = 1;
		}

		printf("%d\n", ans);
	}

	return 0;
}