Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- /*
- ┓┏┓┏┓┃
- ┛┗┛┗┛┃
- ┓┏┓┏┓┃
- ┛┗┛┗┛┃
- ┓┏┓┏┓┃\○/
- ┛┗┛┗┛┃ / /
- ┓┏┓┏┓┃ノ
- ┛┗┛┗┛┃
- ┓┏┓┏┓┃
- ┛┗┛┗┛┃
- ┓┏┓┏┓┃
- ┛┗┛┗┛┃
- ┓┏┓┏┓┃
- ┛┗┛┗┛┃
- ┓┏┓┏┓┃┓
- ┛┗┛┗┛┃┃
- MIPTCLASSICMIPTCLASSICMIPTCLASSICMIPTCLASSICMIPTCLASSICMIPTCLASSIC
- */
- // #define pragma
- #ifdef pragma
- #pragma GCC optimize("Ofast")
- #pragma GCC optimize("no-stack-protector")
- #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
- #pragma GCC optimize("unroll-loops")
- #pragma GCC diagnostic ignored "-Wunused-result"
- #endif // pragma
- #include<bits/stdc++.h>
- #include <ext/pb_ds/assoc_container.hpp>
- #include <ext/pb_ds/tree_policy.hpp>
- #define ll long long
- #define all(x) begin(x), end(x)
- #define pb push_back
- #define x first
- #define y second
- #define int long long
- #define zero(two) memset(two, 0, sizeof(two))
- using namespace std;
- using namespace __gnu_pbds;
- typedef vector<int> vi;
- typedef vector<bool> vb;
- typedef pair<int, int> pii;
- typedef long double ld;
- typedef vector<vi> matrix;
- template<typename T>
- using kawaii_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
- const ld PI = atan2(0, -1);
- void seriy() {
- ios::sync_with_stdio(0);
- cin.tie(0);
- cout.tie(0);
- cout << fixed << setprecision(10);
- #if 1
- freopen("input", "r", stdin);
- freopen("output", "w", stdout);
- #endif
- }
- const int INF = 1e9 + 7;
- matrix g, res, res2;
- vi a;
- map<int, int> mp;
- vb used;
- void dfs(int u, int cnt) {
- used[u] = 1;
- mp[u] = cnt + 1;
- res[cnt].pb(a[u]);
- res2[cnt].pb(u);
- for(auto v : g[u]) {
- if(!used[v]) {
- dfs(v, cnt);
- }
- }
- }
- signed main() {
- seriy();
- int n, m;
- cin >> n >> m;
- a.resize(n);
- g.resize(n);
- used.resize(n);
- int pos1;
- for(int i = 0; i < n; i++) {
- cin >> a[i];
- }
- for(int i = 0; i < m; i++) {
- int u, v;
- cin >> u >> v;
- u--;
- v--;
- g[u].pb(v);
- g[v].pb(u);
- }
- int cnt = 0;
- for(int i = 0; i < n; i++) {
- if(!used[i]) {
- res.pb({});
- res2.pb({});
- dfs(i, cnt);
- cnt++;
- }
- }
- for(int i = 0; i < res.size(); i++) {
- sort(all(res[i]), greater<int>());
- sort(all(res2[i]), greater<int>());
- }
- int anss = 0;
- for(int j = 0; j < res.size(); j++) {
- int st = res[j].back();
- matrix cp = res;
- vi ans(n);
- int bg = res2[j].back();
- cp[j].pop_back();
- ans[bg] = st;
- for(int i = bg + 1; i < n; i++) {
- int bck = cp[mp[i] - 1].back();
- ans[i] = bck;
- cp[mp[i] - 1].pop_back();
- }
- for(int i = 0; i < bg; i++) {
- int bck = cp[mp[i] - 1].back();
- ans[i] = bck;
- cp[mp[i] - 1].pop_back();
- }
- // for(auto i : ans) {
- // cerr << i << " ";
- // }
- // cerr << '\n';
- vi dp(n + 1, INF);
- dp[0] = 0;
- int ress = 0;
- for(int i = 0; i < n; i++) {
- int pos = upper_bound(all(dp), ans[i]) - dp.begin();
- if(dp[pos - 1] < ans[i] && ans[i] < dp[pos]) {
- ress = max(ress, pos);
- dp[pos] = ans[i];
- }
- }
- anss = max(anss, ress);
- }
- cout << anss;
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement