实验7：Problem A: STL——灵活的线性表

#include<iostream>
#include<vector>
#include<string>
using namespace std;
int main()
{
    string l;
    int m,n,k;
    vector<int> a;
    vector<int>::iterator p;
    ///a.clear();
    while(cin>>l){
    if(l=="Build"){cin>>m>>n;a.assign(m,n);}
    else if(l=="Modify"){cin>>m>>n;a[m-1]=n;}
    else if(l=="Insert"){cin>>m>>n>>k;a.insert(a.begin()+m-1,a.begin()+n-1,a.begin()+k);}
    else if(l=="Erase"){cin>>m>>n;a.erase(a.begin()+m-1,a.begin()+n);}
    else if(l=="Print")
    {
        cin>>m>>n;
        int i;
        for(i=m-1;i<n;i++)
        {
            if(i!=n-1)
            cout<<"["<<i+1<<"]"<<":"<<a[i]<<" ";
            else
                cout<<"["<<i+1<<"]"<<":"<<a[i]<<endl;
        }
    }
    }
    return 0;
}