zoukankan      html  css  js  c++  java
  • B. Worms Codeforces Round #271 (div2)

    B. Worms
    time limit per test
    1 second
    memory limit per test
    256 megabytes
    input
    standard input
    output
    standard output

    It is lunch time for Mole. His friend, Marmot, prepared him a nice game for lunch.

    Marmot brought Mole n ordered piles of worms such that i-th pile contains ai worms. He labeled all these worms with consecutive integers: worms in first pile are labeled with numbers 1 to a1, worms in second pile are labeled with numbers a1 + 1 to a1 + a2 and so on. See the example for a better understanding.

    Mole can't eat all the worms (Marmot brought a lot) and, as we all know, Mole is blind, so Marmot tells him the labels of the best juicy worms. Marmot will only give Mole a worm if Mole says correctly in which pile this worm is contained.

    Poor Mole asks for your help. For all juicy worms said by Marmot, tell Mole the correct answers.

    Input

    The first line contains a single integer n (1 ≤ n ≤ 105), the number of piles.

    The second line contains n integers a1, a2, ..., an (1 ≤ ai ≤ 103a1 + a2 + ... + an ≤ 106), where ai is the number of worms in the i-th pile.

    The third line contains single integer m (1 ≤ m ≤ 105), the number of juicy worms said by Marmot.

    The fourth line contains m integers q1, q2, ..., qm (1 ≤ qi ≤ a1 + a2 + ... + an), the labels of the juicy worms.

    Output

    Print m lines to the standard output. The i-th line should contain an integer, representing the number of the pile where the worm labeled with the number qi is.

    Sample test(s)
    input
    5
    2 7 3 4 9
    3
    1 25 11
    
    output
    1
    5
    3
    
    Note

    For the sample input:

    • The worms with labels from [12] are in the first pile.
    • The worms with labels from [39] are in the second pile.
    • The worms with labels from [1012] are in the third pile.
    • The worms with labels from [1316] are in the fourth pile.
    • The worms with labels from [1725] are in the fifth pile.

    直接预处理一下就好了。

    代码:
    #include <cstdio>
    #include <iostream>
    int hash[1000100];
    int main(){
        int n;
        scanf("%d",&n);
        int sum=0;
        int temp;
        int sign=0;
        for(int i=1;i<=n;++i){
            scanf("%d",&temp);
            sum+=temp;
            for(int j=sign;j<=sum;++j){
                hash[j]=i;
            }
            sign=sum+1;
        }
        scanf("%d",&n);
        for(int i=0;i<n;++i){
            scanf("%d",&temp);
            printf("%d
    ",hash[temp]);
        }
        return 0;
    }
    


  • 相关阅读:
    网站运维之 优化
    网站运维之 风险防控
    网站运维之 使用IIS日志分析器1.03.exe进行IIS服务器日志分析
    MySQL数据库优化
    深入理解Java GC
    深入理解React虚拟DOM
    深入理解new String()
    深入理解JVM内存模型
    MySQL的四种事务隔离级别
    Node.js Stream(流)
  • 原文地址:https://www.cnblogs.com/blfbuaa/p/6774143.html
Copyright © 2011-2022 走看看