Submission #1105282

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
1105282	2024-10-26 03:10:41	ducanh1234	Split the sequence (APIO14_sequence)	C++17	0 / 100	5 ms	1104 KiB

sequence

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 FOR(i, a, b) for(int i = (a); i <= (b); ++(i))
#define all(x) x.begin(), x.end()
 
const int mxN = 1e5 + 6;
 
int a[mxN], pre[mxN];
 
auto sumSegment(int l, int r) { 
    return pre[r] - (l > 0 ? pre[l - 1] : 0); 
}
 
auto getMidPos(int l, int r){
    return lower_bound(pre + l, pre + r + 1, (l > 0 ? sumSegment(0, l - 1) : 0) + (sumSegment(l, r) / 2)) - pre;
} 
auto maxPointInSeg(int l, int r){
    int midPos = getMidPos(l, r);
    int64_t point = 1LL * sumSegment(l, midPos) * sumSegment(midPos + 1, r);
    assert(l != r);
    return point;
}
 
struct Segment{
    int l, r;
    Segment(int _l, int _r): l(_l), r(_r) {}
 
    bool operator < (const Segment& other) const{
        return maxPointInSeg(l, r) > maxPointInSeg(other.l, other.r); 
    } 
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 0 / 11
• Subtask 2: 0 / 11
• Subtask 3: 0 / 11
• Subtask 4: 0 / 17
• Subtask 5: 0 / 21
• Subtask 6: 0 / 29