zoukankan      html  css  js  c++  java
  • Codeforces500C(SummerTrainingDay01-G)

    C. New Year Book Reading

    time limit per test:2 seconds
    memory limit per test:256 megabytes
    input:standard input
    output:standard output

    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.

    Examples

    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.

     1 //2017-08-01
     2 #include <cstdio>
     3 #include <iostream>
     4 #include <cstring>
     5 #include <algorithm>
     6 
     7 using namespace std;
     8 
     9 const int N = 510;
    10 const int M = 1010;
    11 int w[N], vis[N], b[M], n, m;
    12 
    13 int main(){
    14     while(scanf("%d%d", &n, &m)!=EOF){
    15         for(int i = 0; i < n; i++)
    16             scanf("%d", &w[i]);
    17         for(int i = 0; i < m; i++)
    18             scanf("%d", &b[i]);
    19         int ans = 0;
    20         for(int i = 1; i < m; i++){
    21             memset(vis, 0, sizeof(vis));
    22             for(int j = i-1; j >= 0; j--){
    23                 if(b[i] == b[j])break;
    24                 if(!vis[b[j]-1]){
    25                     ans += w[b[j]-1];
    26                     vis[b[j]-1] = 1;
    27                 }
    28             }
    29         }
    30         printf("%d
    ", ans);
    31     }
    32 
    33     return 0;
    34 }
     
  • 相关阅读:
    好书推介《实战机器学*》
    Web技术图书名单
    大数据技术书,看看有没有感兴趣的
    博客园设置自定义皮肤,添加自定义小模块悬浮天气组件,github图标链接等
    Final Cut Pro 视频剪辑学习记录,快捷操作等
    css 利用 clip-path 裁剪多边形,三角形,梯形,六边形等
    有呀,有呀,设计!有呀,有呀,组件!
    github README添加badge标识,多彩的tag标签
    vue timeline 开箱即用的时间轴组件,日志更新时间轴组件
    那些需要收藏的网站网址
  • 原文地址:https://www.cnblogs.com/Penn000/p/7271952.html
Copyright © 2011-2022 走看看