50099. Seesaw Chandelier
難度:3/5
Second Try: 3.5/5 Used Time: 20:131
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#include <stdio.h>
#include <stdlib.h>
#include <stdint.h>
int n;
uint64_t arr[16384] = {0};
int is_toqure[16384] = {0};
void dfs(int l, int r){
if(r - l < 2) return;
uint64_t l_bucket = 0, r_bucket = 0;
uint64_t l_weight = 0, r_weight = 0;
int p = 0;
for(int i = l; i <= r; i++) r_bucket += arr[i], r_weight += ((p++) * arr[i]);
for(int i = l; i <= r; i++){
if(l_weight > r_weight) return;
else if(l_weight == r_weight){
is_toqure[i] = 1;
dfs(l, i - 1);
dfs(i + 1, r);
return;
}
else{
l_bucket += arr[i], r_bucket -= arr[i];
l_weight += l_bucket, r_weight -= r_bucket;
}
}
return;
}
int main(){
int n; scanf("%d", &n);
for(int i = 0; i < n; i++) scanf("%llu", &arr[i]);
dfs(0, n - 1);
for(int i = 0; i < n; i++){
if(is_toqure[i]) printf("%d\n", i);
}
}