线段树很重要！！！ #include<iostream>#include<cstdio>using namespace std;int a[100005];struct node{int l,r,Min,mid;long long sum,add;}s[500010];void pushDown(int idx){ long long tmp = s[idx].add; int

1.将字符串‘get-element-by-id’,转换成驼峰表示法‘getElementById’ var str = "get-element-by-id" str = str. split( "-"). map(( item, index) => { return index !== 0 ? item = item . charAt ( 0 ). t