codeforces 344A Magnets
来源:互联网 发布:star打印机打印端口 编辑:程序博客网 时间:2024/06/03 05:01
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.
The first line of the input contains an integer n (1 ≤ n ≤ 100000) — the number of magnets. Thenn lines follow. The i-th line (1 ≤ i ≤ n) contains either characters "01", if Mike put thei-th magnet in the "plus-minus" position, or characters "10", if Mike put the magnet in the "minus-plus" position.
On the single line of the output print the number of groups of magnets.
6101010011010
3
401011010
2
The first testcase corresponds to the figure. The testcase has three groups consisting of three, one and two magnets.
The second testcase has two groups, each consisting of two magnets.
看清题意,问的是会合成几块
AC:
#include<bits/stdc++.h>
using namespace std;
int main()
{
long long n;
cin>>n;
getchar();
long long num=1;
char p[100010][3];
for(long long i=0;i<n;i++)
{
scanf("%c%c",&p[i][1],&p[i][2]);
getchar();
}
int sum=1;
for(long long i=1;i<n;i++)
{
if(p[i][1]-p[i-1][2]!=0)
{
sum++;
}
else
{
sum=1;
num++;
}
}
cout<<num;
}
- codeforces 344A Magnets
- CodeForces - 344A Magnets (模拟题)
- CodeForces 344 A.Magnets(水~)
- 344A - Magnets
- Codeforces Round #200 (Div. 2)A. Magnets
- CodeForces #200(Div.2) A. Magnets
- Codeforces Magnets
- A. Magnets
- cf-200-div2-A-MAgnets
- codeforces 595 E. Edo and Magnets
- Codeforces Round #330 (Div. 1) C. Edo and Magnets
- Codeforces Round #330 (Div. 1) C. Edo and Magnets(暴力+矩形覆盖点)
- CodeForces 344A
- codeforces Round #344 A~E
- CodeForces-a
- 【Codeforces Round 330 (Div 2)E】【贪心 暴力】Edo and Magnets 给定矩形最多去除m个,最小面积矩形使得覆盖所有小矩形重心
- Codeforces 903A A
- Codeforces Round #344 (Div. 2)A
- Markdown编辑器测试2
- 在flask中使用jsonify和json.dumps的区别
- springmvc拦截器面对ajax时的处理
- 49. Group Anagrams
- CUSBoost:基于聚类的提升下采样的非平衡数据分类
- codeforces 344A Magnets
- Hibernate之集合配置
- 图像金字塔
- java数据类型
- UML图
- sql server 文件类型
- Stm32F4 4.3寸TFTLCD 硬件部份
- sql语句报错总结
- 行为识别笔记:C3D network-用于视频特征提取的3维卷积网络