习题5-1 UVA1593 代码对齐（vector)

//记录每一行中各个单词的长度
//利用最长的单词长度来确定每一行输出单词的位置
#include<iostream>
#include<cstring>
#include<string>
#include<sstream>
#include<vector>
#include<algorithm>
#include<cstdlib>
#include<cstdio>
using namespace std;
string s;
vector<string>s1[1005];
int maxlen[185];
int main()
{
    int n=0;
    memset(maxlen,0,sizeof(maxlen));
    while(getline(cin,s))
    {
        string str;
        stringstream ss(s);
        int num=0;//num代表第几列的单词
        while(ss>>str)
        {
            if(int(str.length())>maxlen[num])
            {
                maxlen[num]=str.length();
            }
            s1[n].push_back(str);
            num++;
        }
        n++;
    }
    //n变成总的行数
    for(int i=0;i<n;i++)
    {
        for(int j=0;j<int(s1[i].size()-1);j++)
        {
            cout<<s1[i][j];
            for(int k=0;k<=maxlen[j]-int(s1[i][j].length());k++)
            {
                cout<<" ";
            }
        }
        int w=s1[i].size()-1;
        cout<<s1[i][w]<<endl;
    }
    return 0;
}