一定为最优

alternatingSubarray(nums)::type

nums:

maximumSumOfHeights(maxHeights)::type

maxHeights:

0pre,suf[0]*n,[0]*nst1,st2[],[]for

range(n):while

maxHeights[i]maxHeights[st1[-1]]:st1.pop()if

st1:pre[i]pre[st1[-1]](i-st1[-1])*maxHeights[i]else:pre[i](i1)*maxHeights[i]st1.append(i)for

st2

maxHeights[i]maxHeights[st2[-1]]:st2.pop()if

st2:suf[i]suf[st2[-1]](st2[-1]-i)*maxHeights[i]else:suf[i](n-i)*maxHeights[i]st2.append(i)ans

max(ans,pre[i]suf[i]-maxHeights[i])return

ans

那么在a,b路径上权重为j的边数为cnt[a][j]cnt[b][j]-2*cnt[lca][j]

权重最大为26

edges:nei[ed[0]][ed[1]]ed[2]nei[ed[1]][ed[0]]ed[2]q

[[]

range(m):q[queries[i][0]].append([queries[i][1],i])q[queries[i][1]].append([queries[i][0],i])cnt[[0

for

cnt[parent][:]cnt[node][nei[node][parent]]1uf[node]

nodefor

cparent:continuetarjan(c,node)uf[c]nodefor

[nd,ind]

find(uf,nd)visited[node]1tarjan(0,-1)ans

for

cnt[queries[i][0]][j]cnt[queries[i][1]][j]-2*cnt[lca[i]][j]maxcnt

tans[i]

https://baike.baidu.com/item/%E8%A3%B4%E8%9C%80%E5%AE%9A%E7%90%86/5186593?fromtitle%E8%B4%9D%E7%A5%96%E5%AE%9A%E7%90%86fromid5185441

每次操作

jug1Capacityjug2CapacitytargetCapacity:return

Falseif

jug1Capacityjug2CapacitytargetCapacityreturn

targetCapacity%math.gcd(jug1Capacity,jug2Capacity)0