[codeforces 1183F]Topforces Strikes Back

最新推荐文章于 2020-12-27 10:55:55 发布

dxyinme

最新推荐文章于 2020-12-27 10:55:55 发布

阅读量252

点赞数

分类专栏： -------------------乱搞

本文链接：https://blog.csdn.net/dxyinme/article/details/96973879

版权

在即将举行的编程比赛中，作者需要从n个题目中选取不超过三个，要求这些题目的美观度之和最大，但条件是题目间的美观度不能相互整除。你的任务是为每个查询找出最大的美观度总和。采用剪枝策略的暴力搜索方法，通过排除因数关系和从大到小的选择顺序，可以得到最优解。

摘要由CSDN通过智能技术生成

time limit per test : 3 seconds
memory limit per test : 256 megabytes

分数：2400

One important contest will take place on the most famous programming platform (Topforces) very soon!
The authors have a pool of $n$ problems and should choose at most three of them into this contest. The prettiness of the i-th problem is $a_i$ . The authors have to compose the most pretty contest (in other words, the cumulative prettinesses of chosen problems should be maximum possible).

But there is one important thing in the contest preparation: because of some superstitions of authors, the prettinesses of problems cannot divide each other. In other words, if the prettinesses of chosen problems are $x, y, z$ , then $x$ should be divisible by neither $y$ , nor $z, y$ should be divisible by neither $x$ , nor $z$ and $z$ should be divisible by neither $x$ , nor $y$ . If the prettinesses of chosen problems are $x$ and