Run ID | 作者 | 问题 | 语言 | 测评结果 | Time | Memory | 代码长度 | 提交时间 |
---|---|---|---|---|---|---|---|---|
120454 | 施宸雨 | 22数列变换III | C++ | Accepted | 1 MS | 276 KB | 851 | 2025-05-25 20:00:20 |
#include <vector> #include <iostream> using namespace std; int main() { int n; cin >> n; vector<int> arr; for (int i = 0; i < n; ++i) { int num; cin >> num; arr.push_back(num); } int k; cin >> k; vector<int> moves; for (int i = 0; i < k; ++i) { int x; cin >> x; moves.push_back(x); } for (int x : moves) { if (x < 1 || x > arr.size()) { continue; // 根据题目描述,x是有效的,所以这里可以省略 } int val = arr[x-1]; arr.erase(arr.begin() + x-1); arr.push_back(val); } for (size_t i = 0; i < arr.size(); ++i) { cout << arr[i]; if (i != arr.size() - 1) { cout << " "; } } cout << endl; return 0; }