【Problem Description】
You are given n closed, integer intervals [ai, bi] and n integers c1, …, cn.
Write a program that:
1.reads the number of intervals, their endpoints and integers c1, …, cn from the standard input,
2.computes the minimal size of a set Z of integers which has at least ci common elements with interval [ai, bi], for each i = 1, 2, …, n,
3.writes the answer to the standard output
【Input】
The first line of the input contains an integer n (1 <= n <= 50 000) - the number of intervals. The following n lines describe the intervals. The i+1-th line of the input contains three integers ai, bi and ci separated by single spaces and such that 0 <= ai <= bi <= 50 000 and 1 <= ci <= bi - ai + 1.
Process to the end of file.
【Output】
The output contains exactly one integer equal to the minimal size of
该博客介绍了如何使用最短路径算法解决一道竞赛题目——HDU1384 Intervals。题目要求计算满足每个区间至少有ci个共同元素的最小点数。解题思路是建立差分约束系统，并通过SPFA算法求解最长路。
最低0.47元/天 解锁文章
1370
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
