#include <iostream>

using namespace std;

#define N 1000005

int next_num[N], next[N], num[N], end[N];
char color[N];

int main()
{
	scanf("%s",color);
	
	int len = strlen( color );
	int last=0, all =0, start=0;
	
	for(int i=0;i<len;i++)
	{
		next[i] = i+1;
		if(color[last] == color[i])
		{
			
		}
		else 
		{
			next_num[last] = i;
			end[last] = i-1;
			num[last] = i-last;
			last = i;
			all ++;
		}
	}
	next_num[last] = len;
	end[last] = len - 1;
	num[last] = len-last;
	all++;
	
	while(1)
	{
		int max = start;
		last = start;
		for(int i=start;i<len;i=next_num[i])
		{
			if(num[i] > num[max])
			{
				last = max;
				max = i;
			}
		}
		
		if(num[max] == 1) break;
		else
		{
			printf("%c",color[max]);
			for(int i=max,j=0;j<num[max];i=next[i],j++)
			{
				printf(" %d",i+1);
			}
			printf("\n");
		}
		all--;
		
		int ne = next_num[max];
		if(max == start)
		{
			start = ne;
		}
		else if(color[last] == color[ne])
		{
			next[ end[last] ] = ne;
			num[last] += num[ne];
			end[last] = end[ne];
			next_num[last] = next_num[ne];
			all--;
		}
		else
		{
			next[ end[last] ] = ne;
			next_num[last] = ne;
		}
		
		if(start == len) break;
	}
	

	return 0;
}

• Re:帮忙找错的测试数据！我是在是找不出来。感觉不应该WA…… (1436) sunnyboy1001 2007-12-30 17:37:41
  • Re:帮忙找错的测试数据！我是在是找不出来。感觉不应该WA…… (1332) sunnyboy1001 2007-12-30 17:38:53
• 先试试这个CASE吧："RBRBRB...GG...BRBRBRG"，尤其当长度达到100W (0) twolf 2008-01-22 17:31:33
  • Re:先试试这个CASE吧："RBRBRB...GG...BRBRBRG"，尤其当长度达到100W (0) kingload 2008-01-23 09:06:32