RT 代码如下:

#include <bits/stdc++.h>
using namespace std;
queue <int> s;
int n = 1, num = 1;
char c, lc;
int main()
{
	cin >> lc;
	while (cin >> c)
	{
		if (c == lc) num++;
		else
		{
			s.push(num);
			num = 1;
		}
		lc = c;
		n++;
	}
	s.push(num);
	cout << sqrt(n) << " ";
	while (!s.empty())
	{
		cout << s.front() << " ";
		s.pop();
	}
	return 0;
}