第十四届蓝桥杯集训——练习解题阶段(无序阶段)-ALGO-970 数组移动

#include <stdio.h>
void dysz(int ,int *) ;
void shuchu(int ,int *) ;
void change (int,int,int*,int*) ;
int main (void)
{
	int n ;
	scanf ("%d",&n) ;
	int sz[n] ; 
	dysz(n,sz) ;
	
	int js ;
	scanf ("%d",&js) ;
	int sz_[n] ;
	int zjs ;
	while ( js -- > 0 )
	{
		scanf ("%d",&zjs) ;
	}
	change (zjs,n,sz,sz_) ;
	shuchu(n,sz_) ;
	return 0 ;
}

void shuchu(int n,int *p) 
{
	int  i ;
	for  ( i = 0 ; i < n ; i ++ )
	{
		printf ("%d ",p[i]) ; 
	}
}

void change (int shu,int n,int * ol , int * ne )
{
	int i ;
	for ( i = 0 ; i < n ; i ++ )
	{
		if ( ol[i] == shu ) 
		{
			break ;
		}
	} 
	int n_ = n ;
	while ( n -- > 0 )
	{
		if ( i < 0 )
		{
			ne[n] = ol[-- n_] ;
		}
		else
		{
			ne[n] = ol[i--] ;
		}
	}
}

void dysz(int n,int *p)
{
	while ( n > 0 )
	{
		p[--n] = n + 1 ;
	}
}

#include<iostream>
using namespace std;
#define maxsize 10000
int arr[maxsize];
void p(int bi, int n, int m) {
	for (int i = 0;i < m;i++) {
		if (bi >= m) cout << arr[bi - m] << " ";
		else cout << arr[bi] << " ";
		bi++;
	}
}
int main() {
	int m, n, bi;
	cin >> m >> n;
	for (int i = 0; i < m; i++) arr[i] = i+1;
	for (int i = 0; i < n; i++) {
		cin >> bi;
		if (i == n - 1) p(bi, n, m);
	}
}

import java.util.*;
import java.io.*;

public class Main {

    static class input {
        static BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        static StreamTokenizer in = new StreamTokenizer(br);

        static String next() throws IOException {
            return br.readLine();
        }

        static int nextInt() throws IOException {
            in.nextToken();
            return (int) in.nval;
        }

        static long nextLong() throws IOException {
            in.nextToken();
            return (long) in.nval;
        }

        static double nextDouble() throws IOException {
            in.nextToken();
            return in.nval;
        }

    }

    public static void main(String[] args) throws Exception {
        int n = input.nextInt();
        int m = input.nextInt();
        int[] num = new int[n + 1];
        int[] a = new int[m];
        for (int i = 0; i < m; i++) {
            a[i] = input.nextInt();
        }
        for (int i = 1; i < n; i++) {
            num[i] = i + 1;
        }
        num[n] = 1;
        int head = 1;
        int tail = n;
        for (int i = 0; i < m; i++) {
            int x = num[a[i]];
            num[tail] = head;
            head = x;
            tail = a[i];
            num[tail] = head;
        }
        StringBuffer ans = new StringBuffer();
        for (int i = 0; i < n; i++) {
            ans.append(head + " ");
            head = num[head];
        }
        System.out.println(ans.toString());
    }

}

n,m=map(int,input().split())
c=list(range(1,n+1))
a=[list(map(int,input().split()))for x in range(m)]
b=a[-1][0]
a=c[0:b]
b=c[b:]
c=b+a
for i in range(n):
    print(c[i],end=' ')