bdfs
by uid_310801 @ 2022-11-26 22:32:36
百度罢
by OnlyExtreme @ 2022-11-26 22:35:36
```
a[1...n];
for(int i(1);i<n;++i){
for(int j(i+1);j<=n;++j){
if(a[i]>a[j]){
swap(a[i],a[j]);
}
}
}
```
by ABCDTNT__ @ 2022-11-26 22:36:15
swap是啥意思4
by laopig @ 2022-11-26 22:38:26
交换两数
也可以写作
```
int t=a[i];
a[i]=a[j];
a[j]=t;
```
by ABCDTNT__ @ 2022-11-26 22:39:24
@[laopig](/user/754182) 观察可得几个性质。然后用线段树搞一下就可以了。
by xx3333333333333 @ 2022-11-26 22:40:33
《我听不懂》
by laopig @ 2022-11-26 22:48:20
@[lovelyseele](/user/779995) 不得可持久化一下吗
by AC_CSP @ 2022-11-28 15:08:52
@[laopig](/user/754182)
```cpp
#include<bits/stdc++.h>
using namespace std;
const int N=5e3+7;
int a[N],n;
int main(){
scanf("%d",&n);
for(int i=1;i<=n;i++)
scanf("%d",&a[i]);
for(int i=1;i<=n;i++)
for(int j=i+1;j<=n;j++)
if(a[i]>a[j]) swap(a[i],a[j]);
for(int i=1;i<=n;i++)
printf("%d ",a[i]);
printf("\n");
return 0;
}
```
by AC_CSP @ 2022-11-28 15:12:23
@[AC_CSP](/user/481527) 不是，我以为他再说 [NOI2022] 冒泡排序（狗头）
by xx3333333333333 @ 2022-11-28 15:48:20