fork(1) 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.  
  28.  
  29.  
  30. vector<int> a;
  31.  
  32. bool consistency1(int n){
  33. 	int count = 0;
  34.  
  35.  
  36. 	for(int j = 1; j<n-1; j++){
  37. 		int ct1 = 0;
  38. 		int i =j-1;
  39. 		while(i>=0){
  40. 			if(a[i] < a[j]) ct1++;
  41. 			i--;
  42. 		}
  43.  
  44. 		int ct2 = 0;
  45. 		int k =j+1;
  46.  
  47. 		while(k<n){
  48. 			if(a[j] < a[k]) ct2++;
  49. 			k++;
  50. 		}
  51.  
  52. 		count += ct1 * ct2;
  53. 	}
  54.  
  55. 	if(count == 0) return false;
  56. 	return true;
  57.  
  58. }
  59.  
  60.  
  61.  
  62.  
  63. bool consistency2(int n){
  64. 	int count = 0;
  65.  
  66. 	vector<int> prefixMin(n+1, INF);
  67. 	for(int i=0; i<n; i++){
  68. 		prefixMin[i+1] = min(prefixMin[i-1], a[i]);
  69. 	}
  70.  
  71. 	vector<int> sufixMax(n+1, -INF);
  72. 	for(int i=n-1; i>=0; i--){
  73. 		sufixMax[i] = max(sufixMax[i+1], a[i]);
  74. 	}
  75.  
  76. 	for(int j = 1; j<=n-2; j++){
  77. 		if(a[j] > prefixMin[j] && a[j] < sufixMax[j+1]) return true;;
  78.  
  79. 	}
  80.  
  81. 	return false;
  82.  
  83. }
  84.  
  85.  
  86.  
  87.  
  88.  
  89.  
  90.  
  91. bool consistency3(int n){
  92. 	int count = 0;
  93.  
  94. 	vector<int> sufixMax(n+1, -INF);
  95. 	for(int i=n-1; i>=0; i--){
  96. 		sufixMax[i] = max(sufixMax[i+1], a[i]);
  97. 	}
  98.  
  99. 	int mini = a[0];
  100. 	for(int j = 1; j<=n-2; j++){
  101. 		if(a[j] > mini && a[j] < sufixMax[j+1]) return true;;
  102.  
  103. 		mini = min(mini, a[j]);
  104. 	}
  105.  
  106. 	return false;
  107. }
  108.  
  109.  
  110.  
  111.  
  112.  
  113.  
  114.  
  115.  
  116.  
  117.  
  118.  
  119.  
  120.  
  121.  
  122.  
  123.  
  124.  
  125.  
  126.  
  127.  
  128.  
  129.  
  130.  
  131.  
  132. bool practice(int n){
  133.  
  134.  
  135.     return 0;
  136. }
  137.  
  138.  
  139.  
  140.  
  141.  
  142. void solve() {
  143.  
  144.     int n;
  145.     cin>> n;
  146.  
  147.     a.resize(n);
  148.     for(int i=0; i<n; i++) cin >> a[i];
  149.  
  150.     cout << consistency1(n) << " " << consistency2(n) << endl;
  151.  
  152.  
  153. }
  154.  
  155.  
  156.  
  157.  
  158.  
  159. int32_t main() {
  160.     ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
  161.  
  162.     int t = 1;
  163.     cin >> t;
  164.     while (t--) {
  165.         solve();
  166.     }
  167.  
  168.     return 0;
  169. }
Success #stdin #stdout 0.01s 5292KB
comments (?)
stdin
copy 
2
8
18 5 4 3 2 1 8 10
6
5 4 3 2 1 8
stdout
copy 
1 1
0 0
https://ideone.com/tvsGvz
language:
C++14 (gcc 8.3)
created:
6 hours 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!