1月22号acm寒假训练第三题

Time limit1000 msMemory limit262144 kBSourceCodeforces Round #200 (Div. 2)Tagsimplementation *700EditorialAnnouncement Tutorial
C - 3 CodeForces - 344A

problem description

Mad scientist Mike entertains himself by arranging rows of dominoes. He doesn’t need dominoes, though: he uses rectangular magnets instead. Each magnet has two poles, positive (a “plus”) and negative (a “minus”). If two magnets are put together at a close distance, then the like poles will repel each other and the opposite poles will attract each other.

Mike starts by laying one magnet horizontally on the table. During each following step Mike adds one more magnet horizontally to the right end of the row. Depending on how Mike puts the magnet on the table, it is either attracted to the previous one (forming a group of multiple magnets linked together) or repelled by it (then Mike lays this magnet at some distance to the right from the previous one). We assume that a sole magnet not linked to others forms a group of its own.

Mike arranged multiple magnets in a row. Determine the number of groups that the magnets formed.

Input
The first line of the input contains an integer n (1 ≤ n ≤ 100000) — the number of magnets. Then n lines follow. The i-th line (1 ≤ i ≤ n) contains either characters “01”, if Mike put the i-th magnet in the “plus-minus” position, or characters “10”, if Mike put the magnet in the “minus-plus” position.

Output
On the single line of the output print the number of groups of magnets.

Examples
Input
6
10
10
10
01
10
10
Output
3
Input
4
01
01
10
10
Output
2

问题链接：https://vjudge.net/contest/279627#problem/C

问题描述：输入有多少块磁铁，每块磁铁的正负方向，用0，1来表示，计算每块相互靠近后会变成多少个磁铁块。

问题分析：每块磁铁同性相吸，异性相斥。那么只要看相互靠近的磁铁的正负极，异性最终就会变成一个磁铁块，最后输出有多少个磁铁块。

程序说明：只要判断磁铁摆放方向就可以知道这两块磁铁会不会吸引。若摆放方向相同就会相互吸引形成一个磁铁块，反之就会相互排斥。

c++程序如下：

#include<iostream>
using namespace std;
int main()
{	short a[100000];
    int n,b=1;
    cin>>n;
	for(int i=0;i<n;i++)
		cin>>a[i];
	for(int j=0;j<n-1;j++)
	   {
	       if(a[j]==a[j+1]) continue;
	       else  b++;
	   }
	cout<<b<<endl;
}