牛牛学洗牌

#include <iostream>
#include <vector>
#include <string>
#include <algorithm>

using namespace std;

int main()
{
    vector<int> a(13);
    int i = 0;
    for(i=0; i<13; ++i)
    {
        cin >> a[i];
        //a[i-1] = i;
    }
    int n;
    cin >> n;
    vector<int> v(n);
    for(i=0; i<n; ++i)
    {
        cin >> v[i];
    }

    vector<int> last = a;
    for(i=0; i<n; ++i)
    {
        vector<int> v1(13);
        int l = v[i] - 1;
        int r = 12;
        int k = 12;
        while(l >= 0 && r >= v[i])
        {
            v1[k--] = last[l--];
            if(l < 0)
                break;
            v1[k--] = last[r--];
            if(r < v[i])
                break;
        }
        while(l >= 0)
            v1[k--] = last[l--];
        while(r >= v[i])
            v1[k--] = last[r--];

        last = v1;
    }

    for(i=0; i<12; ++i)
        cout << last[i] << " ";
    cout << last[12];
    return 0;
}