fork download
  1. //#pragma GCC optimize("O3", "unroll-loops")
  2. //#pragma GCC target("avx2", "bmi", "bmi2", "lzcnt", "popcnt")
  3.  
  4. #include <bits/stdc++.h>
  5. #define ldb long double
  6. //#define double ldb
  7. #define db double
  8. #define unomap unordered_map
  9. #define unoset unordered_set
  10. #define endl '\n'
  11. #define str string
  12. #define strstr stringstream
  13. #define sz(a) (int)a.size()
  14. #define ll long long
  15. #define int ll
  16. #define pii pair <int, int>
  17. #define pll pair <ll, ll>
  18. #define Unique(a) a.resize(unique(all(a)) - a.begin())
  19. #define ull unsigned ll
  20. #define fir first
  21. #define sec second
  22. #define idc cin.ignore()
  23. #define lb lower_bound
  24. #define ub upper_bound
  25. #define all(s) s.begin(), s.end()
  26. #define rev reverse
  27. #define gcd __gcd
  28. #define pushb push_back
  29. #define popb pop_back
  30. #define pushf push_front
  31. #define popf pop_front
  32. #define mul2x(a, x) a << x
  33. #define div2x(a, x) a >> x
  34. #define lcm(a, b) (a / __gcd(a, b) * b)
  35. #define log_base(x, base) log(x) / log(base)
  36. #define debug cerr << "No errors!"; exit(0);
  37. #define forw(i, a, b) for (int i = a; i <= b; ++i)
  38. #define forw2(i, a, b) for (ll i = a; i <= b; ++i)
  39. #define fors(i, a, b) for (int i = a; i >= b; --i)
  40. #define fors2(i, a, b) for (ll i = a; i >= b; --i)
  41. #define pqueue priority_queue
  42. #define sqrt sqrtl
  43. #define i128 __int128
  44. #define popcount __builtin_popcountll
  45. #define BIT(x, i) (((x) >> (i)) & 1)
  46. #define MASK(x) ((1LL) << (x))
  47. #define want_digit(x) cout << fixed << setprecision(x);
  48. #define excuting_time 1000.0 * clock() / CLOCKS_PER_SEC
  49. using namespace std;
  50. const int MOD = 1e9 + 7; // 998244353
  51. const int inf = 1e9;
  52. const ll INF = 1e18;
  53. const int N = 5e4;
  54.  
  55. mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
  56. ll random(const ll &L, const ll &R) {
  57. return uniform_int_distribution<ll> (L, R) (rng);
  58. }
  59.  
  60. int n, p[N + 5], sum[N + 5];
  61. ll ans, preMin[N + 5], sufMin[N + 5];
  62. int get(int l, int r) {
  63. return sum[r] - sum[l - 1];
  64. }
  65.  
  66. ll square(int x) {
  67. return x * 1LL * x;
  68. }
  69.  
  70. void solve() {
  71. cin >> n;
  72. forw (i, 1, n) {
  73. cin >> p[i];
  74. sum[i] = sum[i - 1] + p[i];
  75. }
  76.  
  77. forw (i, 0, n) preMin[i] = INF;
  78. forw (i, 0, n + 1) sufMin[i] = INF;
  79.  
  80. forw (y, 2, n - 2) {
  81. ll curMin = INF;
  82. forw (x, 1, y - 1) {
  83. ll A = get(1, x);
  84. ll B = get(x + 1, y);
  85. ll val = square(A) + square(B);
  86. if (val < curMin) curMin = val;
  87. }
  88. preMin[y] = curMin;
  89. }
  90.  
  91. fors (y, n - 2, 2) {
  92. ll curMin = INF;
  93. forw (z, y + 1, n - 1) {
  94. ll C = get(y + 1, z);
  95. ll D = get(z + 1, n);
  96. ll val = square(C) + square(D);
  97. if (val < curMin) curMin = val;
  98. }
  99. sufMin[y] = curMin;
  100. }
  101.  
  102. ll ans = INF;
  103. forw (y, 2, n - 2) {
  104. if (preMin[y] == INF || sufMin[y] == INF) continue;
  105. ll val = preMin[y] * sufMin[y];
  106. if (val < ans) ans = val;
  107. }
  108.  
  109. cout << ans << endl;
  110. }
  111.  
  112. signed main() {
  113. ios::sync_with_stdio(false), cin.tie(nullptr);
  114. srand(time(NULL));
  115. #define name "test"
  116. if (fopen(name".INP", "r")) {
  117. freopen(name".INP", "r", stdin);
  118. freopen(name".OUT", "w", stdout);
  119. }
  120. bool testCase = false;
  121. int numTest = 1;
  122. // cin >> numTest;
  123. forw (i, 1, numTest) {
  124. if (testCase) cout << "Case " << i << ": ";
  125. solve();
  126. }
  127. return 0;
  128. }
  129.  
Success #stdin #stdout 0.01s 5320KB
stdin
6
1 1 2 1 1 2
stdout
36