Good Bye 2014 C. New Year Book Reading 贪心
来源:互联网 发布:skype网络电话机 编辑:程序博客网 时间:2024/05/17 06:09
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?
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.
Print the minimum total weight of books he should lift, which can be achieved by rearranging the order of stacked books.
3 51 2 31 3 2 3 1
12
Here's a picture depicting the example. Each vertical column presents the stacked books.
#define N 505#define M 1005#define maxn 205#define MOD 1000000000000000007int n,m,w[N],t,b[M];list<int> l;list<int>::iterator it;bool vis[N];int main(){ //freopen("in.txt", "r", stdin); //freopen("out.txt", "w", stdout); while(S2(n,m)!=EOF) { fill(vis,false); l.clear(); FI(n) S(w[i]); ll ans = 0; FI(m){ S(t);t--; b[i] = t; if(!vis[t]){ vis[t] = true; l.insert(l.end(),t); } } /* for(it = l.begin();it != l.end();it++){ printf("%d ",*it); } cout<<endl */ FI(m){ t = b[i]; it = l.begin(); if(*it != t){ while(*it != t){ ans += w[*it]; it++; } l.erase(it); l.insert(l.begin(),t); } } cout<<ans<<endl; } //fclose(stdin); //fclose(stdout); return 0;}
- Good Bye 2014 C. New Year Book Reading 贪心
- CF~Good Bye 2014 C. New Year Book Reading
- 【Good Bye 2014C】【脑洞】New Year Book Reading 书放一摞依次看 最佳顺序使费用最小
- C. New Year Book Reading
- C. New Year Book Reading
- CodeForces 500 C. New Year Book Reading(贪心)
- 【CodeForces】500C - New Year Book Reading(贪心)
- codeforces 500C New Year Book Reading (贪心+思维)
- Codeforces 500C:New Year Book Reading(思维+贪心?)
- CodeForces 500C New Year Book Reading 贪心
- 【Goodbye2014】Codeforces 500C New Year Book Reading【贪心+模拟】
- CodeForces 500C New Year Book Reading(贪心+思维)
- New Year Book Reading(贪心)
- Good Bye 2014 E. New Year Domino
- Good Bye 2014--A. New Year Transportation
- Good Bye 2014--B. New Year Permutation
- Good Bye 2014 B. New Year Permutation
- New Year Book Reading
- 用Eclipse建spring mvc项目(图解)
- PAT 1058. A+B in Hogwarts (20)
- struts2 jar包说明
- python 字典排序
- POJ 1065 Wooden Sticks
- Good Bye 2014 C. New Year Book Reading 贪心
- Burp Suite--攻击web 应用程序的集成平台
- 接口详解
- iOS项目开发实战——使用三种方式实现页面跳转与参数传递(二)
- Opensack Issue & Solution: "HypervisorUnavailable: Connection to the hypervisor is broken on host"
- java多线程学习生产者消费者
- TPS和事务响应时间的关系【转】
- input子系统详解
- Android 实现m3u8视频缓存