Codeforces723 B. Text Document Analysis (模拟/水)
来源:互联网 发布:淘宝手机端套餐设置 编辑:程序博客网 时间:2024/05/16 09:48
题目连接:http://codeforces.com/contest/723/problem/B
题目大意:统计括号外最长的连续字母的最大长度以及括号里有多少个连续的字母。
解题思路:直接看样例然后就直接搞。这题面真不想去看呀。
/* ***********************************************┆ ┏┓ ┏┓ ┆┆┏┛┻━━━┛┻┓ ┆┆┃ ┃ ┆┆┃ ━ ┃ ┆┆┃ ┳┛ ┗┳ ┃ ┆┆┃ ┃ ┆┆┃ ┻ ┃ ┆┆┗━┓ 马 ┏━┛ ┆┆ ┃ 勒 ┃ ┆ ┆ ┃ 戈 ┗━━━┓ ┆┆ ┃ 壁 ┣┓┆┆ ┃ 的草泥马 ┏┛┆┆ ┗┓┓┏━┳┓┏┛ ┆┆ ┃┫┫ ┃┫┫ ┆┆ ┗┻┛ ┗┻┛ ┆************************************************ */#include <stdio.h>#include <string.h>#include <iostream>#include <algorithm>#include <vector>#include <queue>#include <stack>#include <set>#include <map>#include <string>#include <math.h>#include <stdlib.h>#include <bitset>using namespace std;#define rep(i,a,b) for (int i=(a),_ed=(b);i<=_ed;i++)#define per(i,a,b) for (int i=(b),_ed=(a);i>=_ed;i--)#define pb push_back#define mp make_pairconst int inf_int = 2e9;const long long inf_ll = 2e18;#define inf_add 0x3f3f3f3f#define mod 1000000007#define LL long long#define ULL unsigned long long#define MS0(X) memset((X), 0, sizeof((X)))#define SelfType intSelfType Gcd(SelfType p,SelfType q){return q==0?p:Gcd(q,p%q);}SelfType Pow(SelfType p,SelfType q){SelfType ans=1;while(q){if(q&1)ans=ans*p;p=p*p;q>>=1;}return ans;}#define Sd(X) int (X); scanf("%d", &X)#define Sdd(X, Y) int X, Y; scanf("%d%d", &X, &Y)#define Sddd(X, Y, Z) int X, Y, Z; scanf("%d%d%d", &X, &Y, &Z)#define reunique(v) v.resize(std::unique(v.begin(), v.end()) - v.begin())#define all(a) a.begin(), a.end()#define mem(x,v) memset(x,v,sizeof(x))typedef pair<int, int> pii;typedef pair<long long, long long> pll;typedef vector<int> vi;typedef vector<long long> vll;inline int read(){int ra,fh;char rx;rx=getchar(),ra=0,fh=1;while((rx<'0'||rx>'9')&&rx!='-')rx=getchar();if(rx=='-')fh=-1,rx=getchar();while(rx>='0'&&rx<='9')ra*=10,ra+=rx-48,rx=getchar();return ra*fh;}//#pragma comment(linker, "/STACK:102400000,102400000")char s[300];int main(){//freopen("in.txt","r",stdin);//freopen("out.txt","w",stdout);ios::sync_with_stdio(0);cin.tie(0);int n;n = read();scanf("%s",s);int mx = 0,sum = 0;for(int i=0;i<n;) { while(s[i]=='_' && i<n) i++; int p = 1; if(s[i]!='(') { int cnt = 0; while(((s[i]>='a'&&s[i]<='z') || (s[i]>='A'&&s[i]<='Z')) && i<n) { i++; cnt++; } mx = max(cnt,mx); } else { i++; while(s[i]!=')') { while(s[i]=='_' && i<n) i++; int flag = 0; while(((s[i]>='a'&&s[i]<='z') || (s[i]>='A'&&s[i]<='Z')) && i<n) { i++; flag = 1; } if(flag)sum++; } i++; } }printf("%d %d\n",mx,sum);return 0;}
0 0
- Codeforces723 B. Text Document Analysis (模拟/水)
- CodeForces 723B-Text Document Analysis(模拟)
- B. Text Document Analysis
- 【Codeforces Round 375 (Div 2) B】【水模拟】Text Document Analysis
- Codeforces #375(Div.2)B.Text Document Analysis【模拟】水题
- Codeforces 723B Text Document Analysis (字符串处理)
- CodeForces 723B Text Document Analysis(字符串的分析)
- [codeforces] B. Text Document Analysis 字符分析
- 【44.10%】【codeforces 723B】Text Document Analysis
- Codeforces 723 B. Text Document Analysis
- Text Document Analysis Codeforces Round#375-B
- Codeforces 723B Text Document Analysis
- Codeforce 723B - Text Document Analysis
- CF 723B Text Document Analysis
- CodeForces 723B Text Document Analysis
- 【cf 723B】 Text Document Analysis
- Codeforces 723B-Text Document Analysis
- Codeforces Round #375 (Div. 2) B.Text Document Analysis(分类暴力)
- 14 idea 配置, 部署eclipse web项目
- STL学习笔记(一)
- noip2012同余方程
- 【神经网络与深度学习】【C/C++】ZLIB学习
- codeforces723BText Document Analysis+水题
- Codeforces723 B. Text Document Analysis (模拟/水)
- 浮点型数据存储方式
- 【9】Job Stores
- html布局中如何去掉a标签的下划线和防止标签颜色变化
- Codeforces 723E.One-Way Reform
- 求一个十进制正整数在二进制表示中的二进制数字个数
- noip2012借教室
- 【神经网络与深度学习】【C/C++】ZLIB学习2
- 求素数最优代码(python)