codeforces题目之1175 C. Lose it!

最新推荐文章于 2021-05-02 15:33:39 发布

CZYQ_Cz1

最新推荐文章于 2021-05-02 15:33:39 发布

阅读量673

点赞数

分类专栏：编程之路

本文链接：https://blog.csdn.net/qq_28818465/article/details/92444544

版权

博客解析了一个codeforces的编程问题，问题要求从给定数组中移除最少元素以使其变成长度为6的倍数且能组成[4,8,15,16,23,42]子序列的数组。解题方法包括创建一个目标序列，并通过遍历原数组计算能形成目标序列的元素数量。" 132495368,11419894,Hadoop生态：HDFS生产调优详解,"['Hadoop', '大数据', 'HDFS调优']

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

题目

C. Lose it!
time limit per test2 seconds
memory limit per test256 megabytes
inputstandard input
outputstandard output
You are given an array a consisting of n integers. Each ai is one of the six following numbers: 4,8,15,16,23,42.
Your task is to remove the minimum number of elements to make this array good.
An array of length k is called good if k is divisible by 6 and it is possible to split it into k6 subsequences 4,8,15,16,23,42.
Examples of good arrays:
[4,8,15,16,23,42] (the whole array is a required sequence);
[4,8,4,15,16,8,23,15,16,42,23,42] (the first sequence is formed from first, second, fourth, fifth, seventh and tenth elements and the second one is formed from remaining elements);
[] (the empty array is good).
Examples of bad arrays:
[4,8,15,16,42,23] (the order of elements should be exactly 4,8,15,16,23,42);
[4,8,15,16,23,42,4] (the length of the array is no