Uva1593 代码对齐

#include <set>
#include <numeric>
#include <cmath>
#include <queue>
#include <stack>
#include <vector>
#include <string>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <algorithm>
#include <cctype>
#include <string>
#include <sstream>
#include <map>
#include <functional>

using namespace std;

typedef long long LL;

#define REP(idx1,num1) for(int idx1=0;idx1<(num1);idx1++)

string s[1100][2000];
int len[2000];
int len2[2000];//第i组有多少个单词
int main()
{
//freopen("/Users/user/Desktop/1.txt","r",stdin);

memset(len,0,sizeof(len));
int i = 0;
string tmp;
while(getline(cin,tmp))
{
stringstream ss(tmp);
string tmp2;
int cnt = 0;//第几个单词
while(ss >> tmp2)
{
//cout << tmp2 << endl;
int len_tmp = tmp2.length();
len[cnt] = max(len[cnt],len_tmp+1);
s[i][cnt++] = tmp2;
}
len2[i] = cnt;
i++;
}
i--;//多少组
for(int l = 0; l <= i; l++)//第l组
{
for(int j = 0; j < len2[l]; ++j)//第j个
{
if(j == len2[l] -1)
{
cout <<s[l][j];
break;
}
string sss = s[l][j];
for(int m = s[l][j].size(); m < len[j]; m++)
{
sss += " ";
}
cout << sss;
}
cout << endl;
}
return 0;
}