1
  2
  3
  4
  5
  6
  7
  8
  9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 21
 22
 23
 24
 25
 26
 27
 28
 29
 30
 31
 32
 33
 34
 35
 36
 37
 38
 39
 40
 41
 42
 43
 44
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
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
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
#include <bits/stdc++.h>
#ifndef ONLINE_JUDGE
# pragma GCC diagnostic warning "-Wall"
# pragma GCC diagnostic warning "-Wextra"
# pragma GCC diagnostic warning "-Wformat=2"
# pragma GCC diagnostic warning "-Wnull-dereference"
# pragma GCC diagnostic warning "-Wduplicated-branches"
# pragma GCC diagnostic warning "-Wduplicated-cond"
# pragma GCC diagnostic warning "-Wfloat-equal"
# pragma GCC diagnostic warning "-Wshadow"
# pragma GCC diagnostic warning "-Wconversion"
# pragma GCC diagnostic warning "-Wlogical-op"
# pragma GCC diagnostic warning "-Wvector-operation-performance"
# pragma GCC diagnostic warning "-Wdisabled-optimization"
# pragma GCC diagnostic warning "-Wunsafe-loop-optimizations"
# pragma GCC diagnostic warning "-Wdouble-promotion"
#endif
#pragma GCC target "arch=ivybridge", "tune=ivybridge"
#if defined(ONLINE_JUDGE) || !defined(__OPTIMIZE__)
# pragma GCC optimize "Ofast", "inline", "unroll-loops", "ipa-pta", "no-rtti", \
  "no-exceptions", "nothrow-opt", "strict-enums", "stdarg-opt", "tracer"
# pragma GCC target "inline-all-stringops"
#endif
#define rangeof(c) (c).begin(), (c).end()

using namespace std;
using uint = unsigned int;
using ll = long long;
using ull = unsigned long long;
using ld = long double;

ll consec_sum(ll n) {
  if(n <= 0) return 0;
  ll a = n, b = n + 1;
  if(a % 2 == 0) a /= 2; else b /= 2;
  return a * b;
}

pair<int, ll> opt(int const n, vector<int> const& nums) {
  vector<int> num_idx(n);
  for(int i = 0; i < n; i++) {
    num_idx[nums[i]] = i;
  }
  
  ll result = 0;
  int base_l = INT_MAX, base_r = INT_MIN;
  for(int i = n - 1; i >= 0; i--) {
    base_l = min(base_l, num_idx[i]);
    base_r = max(base_r, num_idx[i]);
    if(i - 1 >= 0 && base_l <= num_idx[i - 1] && num_idx[i - 1] <= base_r) continue;
    ll a, b, max_sum = n - i - 1 - (base_r - base_l + 1 - (n - i));
    if(i - 1 < 0) {
      a = base_l;
      b = n - base_r - 1;
    } else if(num_idx[i - 1] < base_l) {
      a = base_l - num_idx[i - 1] - 1;
      b = n - base_r - 1;
    } else {
      a = base_l;
      b = num_idx[i - 1] - base_r - 1;
    }
    if(a > b) swap(a, b);
    ll sub = (a + 1) * (b + 1) - consec_sum(b + a - max_sum) + consec_sum(b - max_sum - 1) + consec_sum(a - max_sum - 1);
    if(max_sum < 0) sub = 0;
    result += sub;
#ifdef DEBUG
    clog << "num=" << i + 1 << " sub=" << sub << " a=" << a << " b=" << b << " max_sum=" << max_sum << endl;
#endif
  }
  return {2 * n + 1, result};
}

pair<int, ll> brute(int const n, vector<int> const& nums) {
  pair<int, ll> result = {0, 0};
  for(int l = 0; l < n; l++) {
    vector<int> interval;
    for(int r = l; r < n; r++) {
      interval.push_back(nums[r]);
      sort(rangeof(interval));
      int score = interval.size() + (interval.size() % 2 == 0 ? interval[interval.size() / 2 - 1] + interval[interval.size() / 2] + 2 : 2 * interval[interval.size() / 2] + 2);
      if(score > result.first) {
        result = {score, 1};
      } else if(score == result.first) {
        result.second++;
      }
    }
  }
  return result;
}

int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  
#ifndef TESTING
  int n;
  cin >> n;
  vector<int> nums(n);
  for(auto &num: nums) {
    cin >> num;
    num--;
  }
  
# ifdef BRUTE
  auto result = brute(n, nums);
# else
  auto result = opt(n, nums);
# endif
  cout << result.first << " " << result.second << endl;

#else
  int n;
  vector<int> nums;
  
  srand(time(nullptr));
  auto gen_test = [&]() {
    n = rand() % 100 + 1;
    nums.resize(n);
    for(int i = 0; i < n; i++) {
      nums[i] = i;
    }
    random_shuffle(rangeof(nums));
  };
  
  for(int test = 1; ; test++) {
    cout << "test " << test;
    cout.flush();
    gen_test();
    auto opt_ans = opt(n, nums);
    auto brute_ans = brute(n, nums);
    if(opt_ans == brute_ans) {
      cout << " \e[32mOK\e[0m" << endl;
    } else {
      cout << " \e[31mFAIL\e[0m" << endl;
      cout << "  " << n << endl;
      cout << "  ";
      for(int i: nums) {
        cout << i + 1 << " ";
      }
      cout << endl;
      cout << "opt ans: " << opt_ans.first << " " << opt_ans.second << endl;
      cout << "brute ans: " << brute_ans.first << " " << brute_ans.second << endl;
      exit(EXIT_FAILURE);
    }
  }
#endif
}

/*
najlepsza funkcja celu zawsze jest rowna 2n+1 czyli taka jaka dla permutacji identycznysciowej


6!!!!!!!!!!
5.!!!!!!!!!
4..!!!!!!!!
3...!!!!!!!
2....!!!!!!
1.....!!!!!
0......!!!!
 0123456789 on b's side

max_sum = 5
a=6
b=9




*/