zoukankan      html  css  js  c++  java
  • 1008 数组元素循环右移问题 (20 分)

    #include <iostream>
    #include <algorithm>
    #include <list>
    using namespace std;
    int main(){
        int n, m;
        cin >> n >> m;
        int *p = new int[n];
        for (int i = 0; i < n; i++)
            cin >> p[i];
        m = m % n;
        reverse(p, p + n - m);  // 算法精髓
        reverse(p + n - m, p + n);
        reverse(p, p + n);
        for (int i = 0; i < n; i++){
            if (i == 0)
                cout << p[i];
            else
                cout << ' ' << p[i];
        }
        delete[] p;
        cout << endl;
        return 0;
    }
  • 相关阅读:
    Codeforces
    Codeforces
    Codeforces
    Codeforces
    Codeforces
    Codeforces
    Codeforces
    Codeforces
    洛谷
    GXU
  • 原文地址:https://www.cnblogs.com/Hk456/p/10714533.html
Copyright © 2011-2022 走看看