Cppcode/5.31.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
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
#include <bits/stdc++.h>
using namespace std;

const int N=1e5+9;
int a[N],n;
int b[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 bbst()
{
    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 mv(int l, int r)
{
    int p = a[l];
    while (l < r)
    {
        while (l < r && a[r] >= p)
            r--;
        a[l] = a[r];
        while (l < r && a[l] <= p)
            l++;
        a[r] = a[l];
    }
    a[l] = p;
    return l;
}

void qs(int l, int r)
{
    if (l < r)
    {
        int pos = mv(l, r);
        qs(l, pos - 1);
        qs(pos + 1, r);
    }
}

//归并排序
void mgst(int l,int r)
{
    int mid=(l+r)>>1;
    int i=l,j=mid+1;
    int cnt=l,num=r-l+1;
    while(i<=mid && j<=r)
    {
        if(a[i]>=a[j])b[cnt++]=a[j++];
        else b[cnt++]=a[i++];
    }
    while(i<=mid)b[cnt++]=a[i++];
    while(j<=r)b[cnt++]=a[j++];

    for(int k=0;k<num;k++,r--)
    {
        a[r]=b[r];
    }
}

void mg(int l,int r)
{
    if(l<r)
    {
        int mid=(l+r)>>1;
        mg(l,mid);
        mg(mid+1,r);
        mgst(l,r);
    }
}


int main()
{
    readd();
    // bbst();
    // qs(1,n);
    // mg(1,n);
    for(int i=1;i<=n;i++) cout<<a[i]<<" ";
    return 0;
}