当前位置:网站首页>CSP student queue
CSP student queue
2022-07-06 09:08:00 【< WRM>】
#include<bits/stdc++.h>
using namespace std;
const int N=1010;
int a[N];
int main() {
int n,m;
scanf("%d",&n);
scanf("%d",&m);
for(int i=1;i<=n;i++) {
a[i]=i;
}
for(int i=0;i<m;i++) {
int p,q;
scanf("%d%d",&p,&q);
for(int j=1;j<=n;j++) {
if(a[j]==p) {
if(q>=0) {
for(int k=j;k<j+q;k++) {
a[k]=a[k+1];
}
a[j+q]=p;
break;
}
else {
q=-1*q;
for(int k=j;k>j-q;k--) {
a[k]=a[k-1];
}
a[j-q]=p;
break;
}
}
}
}
for(int i=1;i<=n;i++) {
printf("%d ",a[i]);
}
return 0;
}
边栏推荐
- 不同的数据驱动代码执行相同的测试场景
- MongoDB 的安装和基本操作
- [OC-Foundation框架]--<Copy对象复制>
- SAP ui5 date type sap ui. model. type. Analysis of the parsing format of date
- What is an R-value reference and what is the difference between it and an l-value?
- Compétences en mémoire des graphiques UML
- 什么是MySQL?MySql的学习之路是怎样的
- Simclr: comparative learning in NLP
- LeetCode:剑指 Offer 04. 二维数组中的查找
- Export IEEE document format using latex
猜你喜欢
[text generation] recommended in the collection of papers - Stanford researchers introduce time control methods to make long text generation more smooth
LeetCode:221. 最大正方形
LeetCode:124. Maximum path sum in binary tree
【文本生成】论文合集推荐丨 斯坦福研究者引入时间控制方法 长文本生成更流畅
LeetCode:498. Diagonal traversal
Selenium+Pytest自动化测试框架实战
BN折叠及其量化
IJCAI2022论文合集(持续更新中)
BMINF的後訓練量化實現
Digital people anchor 618 sign language with goods, convenient for 27.8 million people with hearing impairment
随机推荐
多元聚类分析
MySQL uninstallation and installation methods
注意力机制的一种卷积替代方式
Leetcode刷题题解2.1.1
Niuke winter vacation training 6 maze 2
Advanced Computer Network Review(5)——COPE
go-redis之初始化连接
[today in history] February 13: the father of transistors was born The 20th anniversary of net; Agile software development manifesto was born
LeetCode:236. The nearest common ancestor of binary tree
CUDA realizes focal_ loss
ant-design的走马灯(Carousel)组件在TS(typescript)环境中调用prev以及next方法
SAP ui5 date type sap ui. model. type. Analysis of the parsing format of date
[OC]-<UI入门>--常用控件-UIButton
Mise en œuvre de la quantification post - formation du bminf
CUDA实现focal_loss
LeetCode:34. Find the first and last positions of elements in a sorted array
[oc]- < getting started with UI> -- common controls uibutton
An article takes you to understand the working principle of selenium in detail
随手记01
Mongodb installation and basic operation