UVA 663 Sorting Slides(二分匹配)

这篇博客介绍了如何利用二分匹配算法帮助Clumsey教授整理他混乱的幻灯片,这些幻灯片上的数字需要根据演讲顺序进行排序。教授希望以最小的工作量完成这个任务。输入包含幻灯片上数字的坐标,程序的目标是确定每个数字对应的幻灯片。当无法找到匹配时,输出'none',每个测试用例之间留空行。
摘要由CSDN通过智能技术生成

Sorting Slides

Professor Clumsey is going to give an important talk this afternoon. Unfortunately, he is not a very tidy person and has put all his transparencies on one big heap. Before giving the talk, he has to sort the slides. Being a kind of minimalist, he wants to do this with the minimum amount of work possible.


The situation is like this. The slides all have numbers written on them according to their order in the talk. Since the slides lie on each other and are transparent, one cannot see on which slide each number is written.

Well, one cannot see on which slide a number is written, but one may ded

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值