제출 #385262

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
385262	2021-04-03 21:48:32	penguinhacker	Strah (COCI18_strah)	C++14	110 / 110	191 ms	8684 KiB

strah

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
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ar array
int n, m, p[2000], d[2000], l[2000], r[2000];
string g[2000];
ll ans;
void solve() {
  stack<int> s;
  for (int i = 0; i < m; ++i) {
    while(!s.empty() && d[i] <= d[s.top()])
      s.pop();
    l[i] = s.empty() ? i + 1 : i - s.top();
    s.push(i);
  }
  stack<int>().swap(s);
  for (int i = m - 1; ~i; --i) {
    while(!s.empty() && d[i] < d[s.top()])
      s.pop();
    r[i] = s.empty() ? m - i : s.top() - i;
    s.push(i);
  }
  for (int i = 0; i < m; ++i) {
    if (!d[i])
      continue;
    ll a = l[i], b = r[i];
    ans += d[i] * (d[i] + 1) / 2 * (a * (a + 1) / 2 * b + b * (b + 1) / 2 * a - a * b);
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 11 / 11
• Subtask 2: 11 / 11
• Subtask 3: 11 / 11
• Subtask 4: 11 / 11
• Subtask 5: 11 / 11
• Subtask 6: 11 / 11
• Subtask 7: 11 / 11
• Subtask 8: 11 / 11
• Subtask 9: 11 / 11
• Subtask 10: 11 / 11