Stones on the Table解决方法

最新推荐文章于 2020-10-28 07:39:15 发布

原创最新推荐文章于 2020-10-28 07:39:15 发布 · 431 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#ACM新手训练

C++编程专栏收录该内容

50 篇文章

订阅专栏

本文介绍了一种算法，用于解决给定一排红、绿、蓝三色石头，通过计算得出移除最少数量的石头，使得任意两颗相邻的石头颜色不同。该问题通过遍历石头数组并比较相邻元素来实现，若颜色相同则计数器加一，最终输出计数器数值即为所需移除的最少石头数。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Problem Description
There are n stones on the table in a row, each of them can be red, green or blue. Count the minimum number of stones to take from the table so that any two neighboring stones had different colors. Stones in a row are considered neighboring if there are no other stones between them.
Input
The first line contains integer n (1 ≤ n ≤ 50) — the number of stones on the table.
The next line contains string s, which represents the colors of the stones. We’ll consider the stones in the row numbered from 1 to n from left to right. Then the i-th character s equals “R”, if the i-th stone is red, “G”, if it’s green and “B”, if it’s blue.
Output
Print a single integer — the answer to the problem.
Sample Input

3
RRG

Sample Output

1
问题简述：
输入石头数，然后输入石头各颜色，从其中取出石头，使相邻石头不同颜色。输出取的最少次数。
问题分析：
另外设置一个整形变量，作为输出的“次数”，每发现相邻相同颜色，则增加一次。
c++语言程序如下：

#include <iostream>
using namespace std;
int main()
{
 char*a; 
 int n;
 cin >> n;
 a = new char[n];
 cin >> a;
 int t = 0;
 for (int i = 0; i < n - 1; i++)
  if (a[i] == a[i + 1]) t++;
 cout << t;
}