[AtCoder-nikkei2019_2_qual_d] Shortest Path on a Line
题目大致意思就是:有一张有N个点,编号为1−N的无向图做M次操作,每次操作给出三个正整数L,R,C,对于每对≥L且≤R的整数对(S,T),在(S,T)之间添加一条长度为C的边完成操作后,找出操作后无向图的最短路。#include#include#include#include#include#defineintlonglongusingnamespacestd;typedefpairpii;con