紫书第187页
next_permutation函数
作用:使排列变成字典序更大的下一个排列;
用法:next_permutation(数组起始地址,数组结尾地址);如果有下一个排列,返回true,否则返回false;
代码:
#include<bits/stdc++.h>
#define LL long long
#define pa pair<int,int>
#define lson k<<1
#define rson k<<1|1
#define inf 0x3f3f3f3f
//ios::sync_with_stdio(false);
using namespace std;
const int N=200100;
const int M=1000100;
const LL mod=998244353;
int main(){
ios::sync_with_stdio(false);
int a[11];
for(int i=1;i<=10;i++) a[i]=10-i;
sort(a+1,a+11);
do{
for(int i=1;i<=10;i++) cout<<a[i]<<" ";
cout<<endl;
}while(next_permutation(a+1,a+11));
return 0;
}
prev_permutation函数
作用:使排列变成字典序更小的上一个排列;
用法和next_permutation一样;
代码:
#include<bits/stdc++.h>
#define LL long long
#define pa pair<int,int>
#define lson k<<1
#define rson k<<1|1
#define inf 0x3f3f3f3f
//ios::sync_with_stdio(false);
using namespace std;
const int N=200100;
const int M=1000100;
const LL mod=998244353;
int main(){
ios::sync_with_stdio(false);
int a[11];
for(int i=1;i<=10;i++) a[i]=10-i;
do{
for(int i=1;i<=10;i++) cout<<a[i]<<" ";
cout<<endl;
}while(prev_permutation(a+1,a+11));
return 0;
}