Cppcode/5.29.cpp at main · Make1205/Cppcode · 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
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
#include <bits/stdc++.h>
using namespace std;

const int N=1e5+9;
int a[N],n;


int qp(int a, int b)
{
    if (b == 0)
        return 1;
    if (b % 2 == 1)
        return qp(a, b / 2) * qp(a, b / 2) * a;
    if (b % 2 == 0)
        return qp(a, b / 2) * qp(a, b / 2);
    return 1;
}

inline void write(int res)
{
    if (res < 0)
    {
        putchar('-');
        res = -res;
    }
    if (res > 9)
        write(res / 10);
    putchar(res % 10 + '0');
}

inline int read()
{
    int s = 0, w = 1;
    char c = getchar();
    while (c > '9' || c < '0')
    {
        if (c == '-')
            w = -1;
        c = getchar();
    }
    while (c <= '9' && c >= '0')
    {
        s += (s << 3) + (s << 1) + c - 48;
        c = getchar();
    }
    return s * w;
}

void readd()
{
    n=read();
    for(int i=1;i<=n;i++)
    {
        a[i]=read();
    }
}

// void sort()
// {
//     for(int i=1;i<=n;i++)
//     {
//         for(int j=n;j>i;j--)
//         {
//             if(a[j]<=a[j-1])swap(a[j],a[j-1]);
//         }
//     }
// }

int lbd(int x)
{
    int l = 1, r = n;
    while (l <= r)
    {
        int mid = l + ((r-l)>>1);
        if (x < a[mid])r = mid-1;
        else l = mid+1;
    }
    return l;
}

int ubd(int x)
{
    int l = 1, r = n;
	while(l <= r)
	{
		int mid = l + ((r-l)>>1);
		if(x > a[mid]) l = mid + 1;
		else r = mid - 1;
	}
	return l;
}


int main()
{
    readd();
    sort(a+1,a+1+n);
    int x=read();
    write(ubd(x));
    printf(" ");
    write(lbd(x));
    return 0;
}

/*
4
1 2 4 5
3

4
1 2 2 3
2
*/