Lower Bound

最新推荐文章于 2022-03-02 16:21:00 发布

chen_zan_yu_

最新推荐文章于 2022-03-02 16:21:00 发布

阅读量357

点赞数

分类专栏： lower_bound

本文链接：https://blog.csdn.net/chen_zan_yu_/article/details/84197549

版权

lower_bound 专栏收录该内容

6 篇文章 0 订阅

订阅专栏

滴答滴答---题目链接

For a given sequence $A = \{a_0, a_1, ..., a_{n-1}\}$ which is sorted by ascending order, find the lower bound for a specific value $k$ given as a query.

lower bound: the place pointing to the first element greater than or equal to a specific value, or $n$ if there is no such element.

Input

The input is given in the following format.

$n$
$a_0 \; a_1 \; ,..., \; a_{n-1}$
$q$
$k_1$
$k_2$
:
$k_q$

The number of elements $n$ and each element $a_i$ are given in the first line and the second line respectively. In the third line, the number of queries $q$ is given and the following $q$ lines, $q$ integers $k_i$ are given as queries.

Output

For each query, print the position $i$ ($i = 0, 1, ..., n$) of the lower bound in a line.

Constraints

$1 \leq n \leq 100,000$
$1 \leq q \leq 200,000$
$0 \leq a_0 \leq a_1 \leq ... \leq a_{n-1} \leq 1,000,000,000$
$0 \leq k_i \leq 1,000,000,000$

Sample Input 1

Sample Output 1

1
3
4

下限：指向第一个元素大于或等于某个特定值的位置，或者如果没有这样的元素
则输出n

#include<bits/stdc++.h>
using namespace std;
int main()
{
    vector<int>y;
    vector<int>::iterator up,low;
    int p,q;
    int n;
    scanf("%d",&n);
    for(int i=0; i<n; i++)
    {
        scanf("%d",&q);
        y.push_back(q);
    }
    scanf("%d",&p);
    while(p--)
    {
        scanf("%d",&q);
        low=lower_bound(y.begin(),y.end(),q);
        printf("%d\n",(low-y.begin()));
    }
    return 0;
}