Problems/C.bad_sequence.cpp at master · shashank077/Problems · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
#include <iostream>
#include <vector>
#include <queue>
#include <stack>
#include <algorithm>
#include <math.h>
#include <string>
#include <cstring>
#include <set>
#include <map>

using namespace std;

typedef long long ll;
typedef pair<int,int> pii;
typedef pair<int,pair<int,int>> piii;
typedef vector<int> vi;
typedef vector<pii> vii;

#define ri(a) scanf("%d", &a);
#define rii(a,b) scanf("%d %d", &a, &b);
#define riii(a,b,c) scanf("%d %d %d", &a, &b, &c);
#define rl(a) scanf("%lld", &a);
#define rll(a,b) scanf("%lld %lld", &a, &b);

const int INF = 0x3f3f3f3f;
const ll LLINF = 1e18;
const int maxN = 1e5; // CAMBIAR ESTE

// GJNM
int n;
char w[200005];

int main()
{
	ri(n);
	if (n&1)
	{
		printf("NO\n");
		return 0;
	}
	scanf("%s",w);
	int leftopen = 0;
	int badright = 0;
	for (int i = 0; i < n; ++i)
	{
		if ( w[i] == ')') leftopen--;
		else leftopen++;
		if ( leftopen < 0 )
		{
			leftopen = 0;
			badright++;
		}
	}
	if ( leftopen == badright && leftopen <= 1) printf("YES\n");
	else printf("NO\n");

	return 0;
}