题解-[Cnoi2020]领域极限
参考资料
https://www.luogu.com.cn/blog/qwq-qwq/solution-p6163
大纲
题解-[Cnoi2020]领域极限
Introduction \texttt{Introduction} Introduction
Description \texttt{Description} Description
Solution \texttt{Solution} Solution
Code \texttt{Code} Code
Introduction \color{#000}\texttt{Introduction} Introduction
蒟蒻参赛做不出此题,比赛完后看了神仙 N antf \color{#000}\texttt{N}\color{#f00}\texttt{antf} Nantf 的某个粉丝的题解,于是想到了二分。但是做法比他的更简单。
Description \color{#000}\texttt{Description} Description
[Cnoi2020]领域极限
就是给 n n n 个区间 [ L i , R i ] [L_i,R_i] [Li,Ri],求 a i ∈ [ L i , R i ] a_i\in[L_i,R_i] ai∈[Li,Ri] 使 a n s = ∑ i = 1 n ∑ j = 1 n ∣ a i − a j ∣ ans=\sum\limits_{i=1}^n\sum\limits_{j=1}^n|a_i-a_j| ans=i=1∑nj=1∑n∣a