This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| #include <bits/stdc++.h> | |
| using namespace std; | |
| const int maxn = 1e3 + 10; | |
| int cor[maxn], pr[maxn], br[maxn], dp[maxn][maxn], cp[maxn]; | |
| int n, m, comp; | |
| vector<int> G[maxn]; | |
| void coloring(int x) | |
| { |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| // Convex Hull O(n*log(n)) | |
| // por Lawrence Melo | |
| #include <bits/stdc++.h> | |
| using namespace std; | |
| typedef long long ll; | |
| struct point | |
| { | |
| int x, y; |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| // LCA using Segment Tree | |
| // by Lawrence Melo | |
| #include <bits/stdc++.h> | |
| using namespace std; | |
| const int maxn = 50100; | |
| vector<int> G[maxn]; | |
| int cam[2*maxn], tree[4*maxn], d[maxn], num, f[maxn]; |
NewerOlder