text document analysis – codeforce – 723b

#include <algorithm>
using namespace std;
int () {
	int n;
	cin >> n;
	int p = 0;
	char s;
	int num_words_in = 0;
	int max_length_out = 0;
	int length = 0;
	for (int i = 0; i < n; i++){
		cin >> s;
		if (s == '_' || s == '(' || s == ')') {
			if (p && length) {  num_words_in ++; }
			else max_length_out = max(max_length_out, length);
			length = 0;
		}
		if (s == '(') 
			p = 1;
		if (s == ')')
			p = 0;
		if (('a' <= s && s <= 'z') || ('A' <= s && s <= 'Z'))
			length ++;
	}
	
	max_length_out = max(max_length_out, length);
	cout << max_length_out << " " << num_words_in << endl;
	return 0;
}