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.  
  28.  
  29.  
  30. vector<int> a;
  31.  
  32. //* variant 1 : i == j == k allowed
  33.  
  34. int bruteforce(int n){
  35. 	int ans = -INF;
  36.  
  37. 	for(int i = 0; i < n; i++) {
  38. 	    for(int j = 0; j < n; j++) {
  39. 	        for(int k = 0; k < n; k++) {
  40. 	            int curr = abs(a[i] - a[j] - a[k]) + abs(i - j - k);
  41. 	            ans = max(ans, curr);
  42. 	        }
  43. 	    }
  44. 	}
  45. 	return ans;
  46. }
  47.  
  48. int consistency(int n){
  49.  
  50. 	int max1 = -INF; // ai + i
  51. 	int min1 = INF;  // ai + i
  52.  
  53. 	int max2 = -INF; // i - ai
  54. 	int max3 = -INF; // aj - j 
  55.  
  56. 	for(int i=0; i<n; i++){
  57. 		max1 = max(max1, a[i] + i);
  58. 		min1 = min(min1, a[i] + i);
  59.  
  60. 		max2 = max(max2, i - a[i]);
  61. 		max3 = max(max3, a[i] - i);
  62. 	}
  63.  
  64. 	int ans = max1 - 2*min1;
  65. 	ans = max(ans, 2*max1 - min1);
  66. 	ans = max(ans, max2 + 2*max3);
  67. 	ans = max(ans, max3 + 2*max2);
  68.  
  69. 	return ans;
  70. }
  71.  
  72.  
  73.  
  74.  
  75.  
  76.  
  77.  
  78.  
  79.  
  80. int practice(int n){
  81.  
  82.  
  83.     return 0;
  84. }
  85.  
  86.  
  87.  
  88.  
  89.  
  90. void solve() {
  91.  
  92.     int n;
  93.     cin>> n;
  94.  
  95.     a.resize(n);
  96.     for(int i=0; i<n; i++) cin >> a[i];
  97.  
  98.     cout << bruteforce(n) << " " << consistency(n) << endl;
  99.  
  100.  
  101. }
  102.  
  103.  
  104.  
  105.  
  106.  
  107. int32_t main() {
  108.     ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
  109.  
  110.     int t = 1;
  111.     cin >> t;
  112.     while (t--) {
  113.         solve();
  114.     }
  115.  
  116.     return 0;
  117. }
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/q7LppU
language:
C++14 (gcc 8.3)
created:
21 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!