随笔分类 - ACM-最短路问题
摘要:You are given n closed, integer intervals [ai, bi] and n integers c1, ..., cn. Write a program that: > reads the number of intervals, their endpoints 
        阅读全文
                
摘要:Senior Pan fails in his discrete math exam again. So he asks Master ZKC to give him graph theory problems everyday. The task is simple...
        阅读全文
                
摘要:一、引例 1、一类不等式组的解 二、最短路 1、Dijkstra 2、图的存储 3、链式前向星 4、Dijkstra + 优先队列 5、Bellman-Ford 6、SPFA 7、Floyd-Warshall 三、差分约束 1、数形结合 2、三角不等式 3、解的存在性 4、最大值 => 最小值 5、
        阅读全文
                
摘要:咸鱼睡觉觉 Time Limit: 1000 MS Memory Limit: 64 MB Submit Status 咸鱼要睡觉觉了! 但那群咕咕有点烦。 咸鱼决定要赶走一些咕咕,使得他们不要这么吵。 那kk只咕咕们排成了一列。 咸鱼做出了nn个决定,第ii个决定是要在第aiai只咕咕到第bibi
        阅读全文
                
摘要:咸鱼睡觉觉Time Limit: 1000 MS Memory Limit: 64 MBSubmit Status咸鱼要睡觉觉了!但那群咕咕有点烦。咸鱼决定要赶走一些咕咕,使得他们不要这么吵。那kk只咕咕们排成了一列。咸鱼做出了nn个决定,第ii个决定是要在第...
        阅读全文
                
摘要:You are given an undirected graph with weighted edges. The length of some path between two vertices is the bitwise xor of weights of all edges belongi
        阅读全文
                
摘要:You are given an undirected graph with weighted edges. The length of some path between two vertices is the bitwise xor of weights of a...
        阅读全文
                
 

 
         浙公网安备 33010602011771号
浙公网安备 33010602011771号