Coderforces 374 (Div2)

A

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<vector>
using namespace std;
const int maxn=100+10;
char s[maxn];
int main()
{
    vector<int> v;
    int n;
    scanf("%d",&n);
    scanf("%s",s);
    int cnt=0;
    for(int i=0;i<n;i++){
        if(s[i]=='W') {if(cnt) v.push_back(cnt);cnt=0;}
        else cnt++;
    }
    if(cnt) v.push_back(cnt);
    cout<<(int)v.size()<<endl;
    if((int)v.size()!=0) {for(int i=0;i<v.size();i++) printf("%d%s",v[i],(i==n-1)?"":" ");printf("\n");}
    return 0;
}

B 比赛的时候题目读错了。

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<set>
using namespace std;
const int maxn=1000+10;
char s[maxn],r[maxn];
int main()
{
    set<string> se;
    int n,k,goal;
    int bestcase,wrostcase;
    scanf("%d%d",&n,&k);
    memset(r,0,sizeof(r));
    for(int i=1;i<=n;i++) {
        scanf("%s",s);
        string str(s);
        if(se.count(str)==0) se.insert(str);
        else continue;
        r[strlen(s)]++;
    }
    scanf("%s",s);
    goal=(int)strlen(s);
    int sum=0;
    for(int i=1;i<=goal-1;i++) sum+=r[i];
    if(sum>=k) bestcase=sum+sum/k*5;
    else bestcase=sum;
    bestcase++;
    sum=0;
    for(int i=1;i<=goal;i++) sum+=r[i];
    sum--;
    if(sum>=k) wrostcase=sum+sum/k*5;
    else wrostcase=sum;
    wrostcase++;
    printf("%d %d\n",bestcase,wrostcase);
    return 0;
}