Codeforces Round #387 (Div. 2) E. Comments sstream的用法

E. Comments

链接：

http://codeforces.com/contest/747/problem/E

代码：

#include <map>
#include <set>
#include <cmath>
#include <queue>
#include <stack>
#include <cstdio>
#include <string>
#include <vector>
#include <cstring>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <functional>
using namespace std;
#define rep(i,a,n) for (int i=a;i<=n;i++)
#define per(i,a,n) for (int i=n;i>=a;i--)
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
typedef vector<int> VI;
typedef long long ll;
typedef pair<int, int> PII;
const ll mod = 1e9 + 7;
const int inf = 0x3f3f3f3f;
const double eps = 1e-7;
// head

const int MAXN = 1000005;
vector<pair<string, int> >v;
vector<string>res[MAXN];

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(NULL);
    string str;
    cin >> str;
    for (int i = 0; i<(int)str.size(); i++)
        if (str[i] == ',')str[i] = ' ';
    stringstream ss;
    ss.str(str);
    while (ss >> str)
    {
        int tmp;
        ss >> tmp;
        v.push_back(make_pair(str, tmp));
    }
    stack<int>st;
    st.push(-1);
    for (int i = 0, j = 1; i<(int)v.size(); i++)
    {
        while (st.top() == 0)j--, st.pop();
        res[j].push_back(v[i].first);
        st.top()--;
        st.push(v[i].second), j++;
    }
    int mx = 0;
    for (int i = 1; i<MAXN && !res[i].empty(); i++)
        mx = i;
    cout << mx << endl;
    for (int i = 1; i <= mx; i++)
    {
        for (int j = 0; j<(int)res[i].size(); j++)
            cout << res[i][j] << " ";
        cout << endl;
    }
    return 0;
}