Codeforces Gym 101158 A. Rearranging a Sequence
2017-07-09 15:03
323 查看
题意
有序的 1~N 数字,m 个操作,每次给出 x 值,将数字 x 提到序列的首位。求最终的序列中的每个数。解题思路
将每个数字所在序列中的位置进行标记,标记代表更新的时间。可以考虑更新的时间越新,表示其离序列首位越近。最终根据标记从大到小排序输出每个代表的数字即可。
代码
#include<bits/stdc++.h> using namespace std; int main() { int n, m; pair<int, int> p[200010]; scanf("%d %d", &n, &m); int idx = 0; for(int i=n;i;i--) p[i] = make_pair(++idx, i); for(int i=1, x;i<=m;i++) { scanf("%d", &x); p[x].first = ++idx; } sort(p+1, p+n+1); for(int i=n;i;i--) printf("%d\n", p[i].second); }
相关文章推荐
- Codeforces Gym 101158 F. Three Kingdoms of Bourdelot
- Codeforces GYM 100114 C. Sequence 打表
- Codeforces Gym - 101158 I - Skinny Polygon (扩展欧几里得)
- Codeforces Gym 101158 E. Infallibly Crack Perplexing Cryptarithm (模拟 + 语法分析)
- Codeforces Gym 101158 B. Quality of Check Digits (模拟)
- Codeforces Gym 101158 C. Distribution Center
- 【最大流】ECNA 2015 F Transportation Delegation (Codeforces GYM 100825)
- Codeforces GYM 100962J: Jimi Hendrix 题解
- Codeforces Gym 100962 H. Hans Zimmer
- CodeForces Gym 100500A A. Poetry Challenge DFS
- Codeforces Gym 101173 F. Free Figurines (递归)
- [暴力 树形DP] Codeforces Gym 100553H NEERC14 H. Hidden Maze
- Codeforces Gym - 101234A Hacker Cups and Balls [二分+线段树]
- Codeforces Gym 101138C Stickmen 暴力搜索+组合数
- [构造] Codeforces Gym 101173 CERC 16 K & BZOJ 4796 Key Knocking
- Codeforces Gym 100623E Problem E. Enchanted Mirror
- [分治 杂题] Codeforces Gym 101173 CERC 16 G & BZOJ 4792 Geohash Grid
- Codeforces Gym 100513G G. FacePalm Accounting
- codeforces Gym 100500H A. Potion of Immortality 简单DP
- Codeforces Gym 100231G Voracious Steve 记忆化搜索