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. // 1
  28. // 8 
  29. // 1 -2 5 2 6 10 4 7
  30.  
  31.  
  32.  
  33.  
  34.  
  35. vector<int> a;
  36.  
  37. //* variant 2 : No condition (i.e i == j == k allowed )
  38.  
  39. int bruteforce(int n){
  40. 	int ans = -INF;
  41.  
  42. 	for(int i = 0; i < n; i++) {
  43. 	    for(int j = 0; j < n; j++) {
  44. 	        for(int k = 0; k < n; k++) {
  45. 	            int curr = abs(a[i] - a[j] - a[k]) + abs(i - j - k);
  46. 	            ans = max(ans, curr);
  47. 	        }
  48. 	    }
  49. 	}
  50. 	return ans;
  51. }
  52.  
  53.  
  54.  
  55. int consistency(int n){
  56.  
  57. 	int max1 = -INF;
  58. 	int max2 = -INF;
  59.  
  60. 	int min1 = INF;
  61. 	int min2 = INF;
  62.  
  63. 	for(int i=0; i<n; i++){
  64. 		int add = a[i] + i;
  65. 		int dif = a[i] - i;
  66.  
  67. 		max1 = max(max1, add);
  68. 		min1 = min(min1, add);
  69.  
  70. 		max2 = max(max2, dif);
  71. 		min2 = min(min2, dif);
  72.  
  73. 	}
  74.  
  75. 	int ans = max( {max1 - 2*min1, max2 - 2*min2, 2*max1 - min1, 2*max2 - min2 });
  76.  
  77.  
  78. 	return ans;
  79. }
  80.  
  81.  
  82.  
  83.  
  84.  
  85.  
  86.  
  87.  
  88.  
  89. int practice(int n){
  90.  
  91.  
  92.     return 0;
  93. }
  94.  
  95.  
  96.  
  97.  
  98.  
  99. void solve() {
  100.  
  101.     int n;
  102.     cin>> n;
  103.  
  104.     a.resize(n);
  105.     for(int i=0; i<n; i++) cin >> a[i];
  106.  
  107.     cout << bruteforce(n) << " " << consistency(n) << endl;
  108.  
  109.  
  110. }
  111.  
  112.  
  113.  
  114.  
  115.  
  116. int32_t main() {
  117.     ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
  118.  
  119.     int t = 1;
  120.     cin >> t;
  121.     while (t--) {
  122.         solve();
  123.     }
  124.  
  125.     return 0;
  126. }
Success #stdin #stdout 0.01s 5320KB
comments (?)
stdin
copy 
1
8 
1 -2 5 2 6 10 4 7
stdout
copy 
31 31
https://ideone.com/c7GsXv
language:
C++14 (gcc 8.3)
created:
1 day 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!