CodeForces 723B Text Document Analysis (水题模拟)
Posted dwtfukgv
tags:
篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了CodeForces 723B Text Document Analysis (水题模拟)相关的知识,希望对你有一定的参考价值。
题意:给定一行字符串,让你统计在括号外最长的单词和在括号内的单词数。
析:直接模拟,注意一下在左右括号的时候有没有单词。碰到下划线或者括号表示单词结束了。
代码如下:
#pragma comment(linker, "/STACK:1024000000,1024000000") #include <cstdio> #include <string> #include <cstdlib> #include <cmath> #include <iostream> #include <cstring> #include <set> #include <queue> #include <algorithm> #include <vector> #include <map> #include <cctype> #include <cmath> #include <stack> //#include <tr1/unordered_map> #define freopenr freopen("in.txt", "r", stdin) #define freopenw freopen("out.txt", "w", stdout) using namespace std; //using namespace std :: tr1; typedef long long LL; typedef pair<int, int> P; const int INF = 0x3f3f3f3f; const double inf = 0x3f3f3f3f3f3f; const LL LNF = 0x3f3f3f3f3f3f; const double PI = acos(-1.0); const double eps = 1e-8; const int maxn = 1e2 + 5; const LL mod = 10000000000007; const int N = 1e6 + 5; const int dr[] = {-1, 0, 1, 0, 1, 1, -1, -1}; const int dc[] = {0, 1, 0, -1, 1, -1, 1, -1}; const char *Hex[] = {"0000", "0001", "0010", "0011", "0100", "0101", "0110", "0111", "1000", "1001", "1010", "1011", "1100", "1101", "1110", "1111"}; inline LL gcd(LL a, LL b){ return b == 0 ? a : gcd(b, a%b); } int n, m; const int mon[] = {0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31}; const int monn[] = {0, 31, 29, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31}; inline int Min(int a, int b){ return a < b ? a : b; } inline int Max(int a, int b){ return a > b ? a : b; } inline LL Min(LL a, LL b){ return a < b ? a : b; } inline LL Max(LL a, LL b){ return a > b ? a : b; } inline bool is_in(int r, int c){ return r >= 0 && r < n && c >= 0 && c < m; } int main(){ while(scanf("%d", &n) == 1){ string s; cin >> s; int ans1 = 0, ans2 = 0; int cnt = 0; bool ok = false; for(int i = 0; i < n; ++i){ if(s[i] == ‘(‘){ ans1 = Max(ans1, cnt); cnt = 0; ok = true; } else if(s[i] == ‘)‘){ if(cnt) ++ans2; cnt = 0; ok = false; } else if(isalpha(s[i])) ++cnt; else if(cnt && s[i] == ‘_‘){ if(ok) ++ans2; else ans1 = Max(ans1, cnt); cnt = 0; } } ans1 = Max(ans1, cnt); printf("%d %d\n", ans1, ans2); } return 0; }
以上是关于CodeForces 723B Text Document Analysis (水题模拟)的主要内容,如果未能解决你的问题,请参考以下文章
CodeForces 723B Text Document Analysis (水题模拟)
CodeForces - 697D - Puzzles DFS