My-algorithm/upper_bound,lower_bound.cpp at master · NitaiBanik/My-algorithm · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
#include<bits/stdc++.h>
using namespace std;
#define ll long long
vector<ll>sum1,sum2;
ll lower(ll n,ll val)
{
    ll beg = 0,endd = n-1,mid,loc = -1;
    while(beg<=endd)
    {
        mid = (beg + endd)/2;
        if(sum2[mid] == val)
        {
            endd = mid -1 ;
            loc = mid;
        }
        else if(val>sum2[mid])
            beg = mid +1 ;
        else
            endd = mid-1 ;
    }
    if(loc!=-1)
        return beg;
    else
        return -1;
}
ll upper(ll n,ll val)
{
    ll beg = 0,endd = n-1,mid,loc = -1;
    while(beg<=endd)
    {
        mid = (beg + endd)/2;
        if(sum2[mid] == val)
        {
            beg = mid + 1 ;
            loc = mid;
        }
        else if(val>sum2[mid])
            beg = mid + 1 ;
        else
            endd = mid - 1;
    }
    if(loc!=-1)
        return endd;
    else
        return -1;
}
int main()
{
    for(int i=0; i<5; i++)
    {
        int x;
        cin>>x;
        sum2.push_back(x);
    }
    sort(sum2.begin(),sum2.end());
//

    ll l  = lower(5,5) + 1;
    cout<<l;
    ll u  = upper(5,5) + 1;
    cout<<u;
    //cout<<" l = "<<l<<" u = "<<u<<endl;

}