Codeforces Round #200 (Div. 2)A. Magnets

发布时间:2016-12-6 8:56:28 编辑:www.fx114.net 分享查询网我要评论
本篇文章主要介绍了"Codeforces Round #200 (Div. 2)A. Magnets",主要涉及到Codeforces Round #200 (Div. 2)A. Magnets方面的内容,对于Codeforces Round #200 (Div. 2)A. Magnets感兴趣的同学可以参考一下。

A. Magnets time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output 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. Sample test(s) input 6 10 10 10 01 10 10 output 3 input 4 01 01 10 10 output 2 Note 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. 解题报告 此题意思就是找最长的连接段,非常水的题,代码如下: #include<stdio.h> int main() { int n,i,a1,a2,ans; scanf("%d",&n); ans=1; scanf("%d",&a1); for(i=1;i<n;i++) { scanf("%d",&a2); if(a1==10&&a2==1) { ans++; a1=1; } else if(a1==1&&a2==10) { ans++; a1=10; } } printf("%d\n",ans); return 0; }

上一篇:毛哥的学车经历
下一篇:华为机试-字符串的压缩

相关文章

相关评论