Problem A: STL——灵活的线性表

标签：pen   string   des   bsp   for   ++   ase   std   链表   

Description

Input

Output

Sample Input

Sample Output

HINT

Append Code

代码

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

using namespace std;

int  main()
{
    vector<int>a;
    string s;
    int m,n,k;
    while(cin>>s)
    {
        if(s=="Build")
        {
            cin>>m>>n;
            a.assign(m,n);
        }
        else if(s=="Modify")
        {
            cin>>m>>n;
            a[m-1]=n;
        }
        else if(s=="Insert")
        {
            cin>>m>>n>>k;
            a.insert(a.begin()+m-1,a.begin()+n-1,a.begin()+k);
        }
        else if(s=="Erase")
        {
            cin>>m>>n;
            a.erase(a.begin()+m-1,a.begin()+n);
        }
        else if(s == "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;
        }
        }
    }

}

Problem A: STL——灵活的线性表

标签：pen   string   des   bsp   for   ++   ase   std   链表   

原文地址：http://www.cnblogs.com/go-ahead-TT/p/6766789.html