**
算法竞赛入门经典(第2版) -刘汝佳3-1-UVA1585-Score 习题3-1 得分(Score, ACM/ICPC Seoul 2005, UVa1585)
作者 :Apollo_ZKZ
原题链接 :https://vjudge.net/problem/UVA-1585
(由于uva官网很慢,所以请大家上vjudge)
原题 :There is an objective test result such as “OOXXOXXOOO”. An ‘O’ means a correct answer of a problem
and an ‘X’ means a wrong answer. The score of each problem of this test is calculated by itself and
its just previous consecutive ‘O’s only when the answer is correct. For example, the score of the 10th
problem is 3 that is obtained by itself and its two previous consecutive ‘O’s.
Therefore, the score of “OOXXOXXOOO” is 10 which is calculated by “1+2+0+0+1+0+0+1+2+3”.
You are to write a program calculating the scores of test results.
Input
Your program is to read from standard input. The input consists of T test cases. The number of test
cases T is given in the first line of the input. Each test case starts with a line containing a string
composed by ‘O’ and ‘X’ and the length of the string is more than 0 and less than 80. There is no spaces
between ‘O’ and ‘X’.
Output
Your program is to write to standard output. Print exactly one line for each test case. The line is to
contain the score of the test case.
Sample Input
5
OOXXOXXOOO
OOXXOOXXOO
OXOXOXOXOXOXOX
OOOOOOOOOO
OOOOXOOOOXOOOOX
Sample Output
10
9
7
55
30
大意 :给出一个由O和X组成的串(长度为1~80),统计得分。每个O的得分为目前连续出现的O的个数,X的得分为0。例如,OOXXOXXOOO的得分为1+2+0+0+1+0+0+1+2+3。
分析 :输入字符串后从字符串开头循环,
是‘X’就把O的权值改为0;是‘O’就权值加1,答案加上权值。最后输出答案。
代码:
#include<iostream>
using namespace std;
string s;
int n;
int cnt,cnt2;
int main()
{
cin>>n;
while(n--)
{
cin>>s;
cnt=0,cnt2=0;
for(int i=0;i<s.size();i++)
{
if(s[i]=='X')
{
cnt2=0;
}
else
{
cnt2++;
cnt+=cnt2;
}
}
cout<<cnt<<"\n";
}
return 0;
}