B - V(双指针)

B - V (atcoder.jp)

给定1~n，有m个数，如果相连，就把这段相连的区间到+1的位置倒序输出，也就是[l,r+1]倒序输出r+1,r,r-1,....l,n个数中不在这些个[l,r+1]个区间就按原顺序输出

 

 

#include <iostream>
#include <vector>
#include <bits/stdc++.h>
#include <unordered_map>
#include <unordered_set>
#include <queue>
#include <set>
#include <algorithm>
#define x first
#define y second
#define pb emplace_back
#define fu(i,a,b) for(int i=a;i<=b; ++ i)
#define fd(i,a,b) for(int i=a;i>=b;	-- i)
#define endl '\n'
#define ms(x,y) memset(x,y,sizeof x)
#define ios ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
using namespace std;

typedef long long LL;
typedef unsigned long long ULL;
typedef vector<vector<LL>> VVL;
typedef vector<vector<int>> VVI;
typedef vector<LL> VL;
typedef vector<bool> VB;
typedef vector<int> VI;
typedef vector<string> VS;
typedef pair<int,int> PII;
typedef vector<PII> VPII;
typedef pair<PII,int> PIII;
typedef pair<double,double> PDD;
typedef pair<double,int> PDI;
typedef pair<char,int> PCI;
typedef pair<string,int> PSI;
typedef pair<int,string> PIS;
typedef pair<int,char> PIC;
typedef pair<LL,LL> PLL;
typedef __int128 i128;
typedef unsigned long long ULL;
const int N = 1e5+ 10,M = N * 5  ,INF = 0x3f3f3f3f,P = 131;
const double eps = 1e-8,DNF = 1e18;
const int mod = 1e9 + 7 ,base= 20010;
const LL LNF=(LL) INF * INF;



bool st[N];


inline void solve()
{
	int n,m;cin>> n >> m ;
	
	VB a(n-1);
	int x;
	fu(i,0,m-1) 
	{
		cin >> x;x--;	
		a[x] = 1; 
	}	
	
	for(int l=0,r;l < n; l = r + 1 )
	{
		r = l ;
		while(r < n -1 && a[r]) r ++ ;
		fd(x,r,l)cout << x +  1 << " ";
	}
	
	
	
			
}


signed main()
{
//  freopen("1.txt","r",stdin);
//	#define int long long 
//	init(N-1);
    ios
//	cout << fixed<<setprecision(2);
    int t=1;
//    cin>>t;
    int now = 1;
    while(t -- )
    {
//      cout<<"Case "; 
//      cout<<"Case #"; 
//      cout<<"Scenario #"; 
//      cout<< now ++ <<": ";
//      cout<< now ++ <<": \n";
        solve();
    }


    return 0;
}