该博客介绍了一种用于检测电信诈骗的方法，通过分析电话记录，判断个人是否超过阈值的短电话数量且不超过20%的人回电，以及是否存在相互联系的嫌疑人。文章提供了两种解决思路，包括使用并查集和DFS，并强调了这两种方法在应对此类问题中的适用性。
本题预计2021年3月之后才免费开放。
题目
Telefraud（电信诈骗） remains a common and persistent problem in our society. In some cases, unsuspecting victims lose their entire life savings. To stop this crime, you are supposed to write a program to detect those suspects from a huge amount of phone call records.
A person must be detected as a suspect if he/she makes more than K short phone calls to different people everyday, but no more than 20% of these people would call back. And more, if two suspects are calling each other, we say they might belong to the same gang. A makes a short phone call to B means that the total duration of the calls from A to B is no more than 5 minutes.
Input Specification:
Each input file contains one test case. For each case, the first line gives 3 positive integers K (≤500, the threshold（阈值） of the amount of short phone calls),&nb
最低0.47元/天 解锁文章
扫一扫
到【灌水乐园】发言
