A. One-dimensional Japanese Crossword

題目連接：

http://codeforces.com/contest/721/problem/A

Description

Recently Adaltik discovered japanese crosswords. Japanese crossword is a picture, represented as a table sized a?×?b squares, and each square is colored white or black. There are integers to the left of the rows and to the top of the columns, encrypting the corresponding row or column. The number of integers represents how many groups of black squares there are in corresponding row or column, and the integers themselves represents the number of consecutive black squares in corresponding group (you can find more detailed explanation in Wikipedia https://en.wikipedia.org/wiki/Japanese_crossword).

Adaltik decided that the general case of japanese crossword is too complicated and drew a row consisting of n squares (e.g. japanese crossword sized 1?×?n), which he wants to encrypt in the same way as in japanese crossword.
The example of encrypting of a single row of japanese crossword.

Help Adaltik find the numbers encrypting the row he drew.

Input

The first line of the input contains a single integer n (1?≤?n?≤?100) — the length of the row. The second line of the input contains a single string consisting of n characters 'B' or 'W', ('B' corresponds to black square, 'W' — to white square in the row that Adaltik drew).

Output

The first line should contain a single integer k — the number of integers encrypting the row, e.g. the number of groups of black squares in the row.

The second line should contain k integers, encrypting the row, e.g. corresponding to sizes of groups of consecutive black squares in the order from left to right.

Sample Input

3
BBW

Sample Output

1
2

Hint

題意

給你一個字符串，問里面有幾段B，然后輸出每一段B的個數

題解：

掃一遍就行了……

代碼

#include<bits/stdc++.h> using namespace std;int n; string s; int main() {cin>>n>>s;vector<int> ans;int tmp = 0;for(int i=0;i<s.size();i++){if(s[i]=='B')tmp++;if(s[i]=='W'){if(tmp)ans.push_back(tmp);tmp=0;}}if(tmp)ans.push_back(tmp);cout<<ans.size()<<endl;for(int i=0;i<ans.size();i++)cout<<ans[i]<<" ";cout<<endl; }

轉載于:https://www.cnblogs.com/qscqesze/p/5925873.html

總結

以上是生活随笔為你收集整理的Codeforces Round #374 (Div. 2) A. One-dimensional Japanese Crosswor 水题的全部內容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網站內容還不錯，歡迎將生活随笔推薦給好友。