HDU1384 Intervals 题解 【差分约束】

该博客介绍了如何使用最短路径算法解决一道竞赛题目——HDU1384 Intervals。题目要求计算满足每个区间至少有ci个共同元素的最小点数。解题思路是建立差分约束系统,并通过SPFA算法求解最长路。
摘要由CSDN通过智能技术生成

【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

  • 1
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值