fork download
copy 
  1. #include <bits/stdc++.h>
  2. using namespace std;
  3. #define int              long long int
  4. #define double           long double
  5. #define print(a)         for(auto x : a) cout << x << " "; cout << endl
  6.  
  7.  
  8. const int M = 1000000007;
  9. const int N = 3e5+9;
  10. const int INF = 2e9+1;
  11. const int LINF = 2000000000000000001;
  12.  
  13. inline int power(int a, int b, int mod=M) {
  14.     int x = 1;
  15.     a %= mod;
  16.     while (b) {
  17.         if (b & 1) x = (x * a) % mod; 
  18.         a = (a * a) % mod;
  19.         b >>= 1;
  20.     }
  21.     return x;
  22. }
  23.  
  24.  
  25. //_ ***************************** START Below *******************************
  26.  
  27. // 10
  28. // 1 2 4 3 7 6 1 8 10 2
  29.  
  30.  
  31. vector<int> a;
  32.  
  33.  
  34. int consistency1(int n){
  35. 	vector<vector<int>> subs;
  36.  
  37. 	for(int i=0; i<n; i++){
  38. 		int k = -1;
  39. 		int maxi = -1e18;
  40.  
  41. 		//* Find maximum endings  where  ends < a[i]
  42. 		for(int j=0; j<subs.size(); j++){
  43. 			if(subs[j].back() < a[i] && subs[j].back() > maxi){
  44. 				maxi = subs[j].back();
  45. 				k = j;
  46. 			}
  47. 		}
  48.  
  49. 		if(k == -1) subs.push_back({a[i]});
  50. 		else subs[k].push_back(a[i]);
  51. 	}
  52.  
  53. 	return subs.size();
  54. }
  55.  
  56.  
  57.  
  58.  
  59.  
  60.  
  61. int consistency2(int n){
  62.  
  63. 	multiset<int> st;
  64.  
  65. 	for(int i=0; i<n; i++){
  66. 		auto it = st.lower_bound(a[i]);
  67. 		if(it != st.begin()){
  68. 			--it;
  69. 			st.erase(it);
  70. 		}
  71. 		st.insert(a[i]);
  72. 	}
  73.  
  74. 	return st.size();
  75. }
  76.  
  77.  
  78.  
  79.  
  80.  
  81.  
  82.  
  83.  
  84.  
  85.  
  86.  
  87.  
  88.  
  89.  
  90.  
  91. int practice(int n){
  92.  
  93.  
  94.     return 0;
  95. }
  96.  
  97.  
  98.  
  99.  
  100.  
  101. void solve() {
  102.  
  103.     int n;
  104.     cin>> n;
  105.  
  106.     a.resize(n);
  107.     for(int i=0; i<n; i++) cin >> a[i];
  108.  
  109.     cout << consistency1(n) << " " << consistency2(n) << endl;
  110.  
  111.  
  112. }
  113.  
  114.  
  115.  
  116.  
  117.  
  118. int32_t main() {
  119.     ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
  120.  
  121.     int t = 1;
  122.     // cin >> t;
  123.     while (t--) {
  124.         solve();
  125.     }
  126.  
  127.     return 0;
  128. }
Success #stdin #stdout 0s 5312KB
comments (?)
stdin
copy 
10
1 2 4 3 7 6 1 8 10 2
stdout
copy 
3 3
https://ideone.com/3ktaFl
language:
C++14 (gcc 8.3)
created:
3 days ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!