C - Colorful Candies

最新推荐文章于 2024-10-06 14:42:09 发布

夏牧

最新推荐文章于 2024-10-06 14:42:09 发布

阅读量161

点赞数

文章标签： c语言 c++

本文链接：https://blog.csdn.net/weixin_51921986/article/details/125255957

版权

Takahashi面对一排包含N个不同颜色糖果的问题，他可以选择K个连续糖果，目标是获得最多颜色种类。给定每个糖果的颜色和K的范围，找出最大可能的不重复颜色数量。题目要求O(1)时间复杂度解决方案，可以使用map记录颜色及其出现次数。

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

Problem Statement

There are NN candies arranged in a row from left to right.Each of these candies has one color that is one of the 109109 colors called Color 11, Color 22, ……, and Color 109109.For each i=1,2,…,Ni=1,2,…,N, the color of the ii-th candy from the left is Color cici.From this row, Takahashi can choose KK consecutive candies and get them.That is, he can choose an integer ii such that 1≤i≤N−K+11≤i≤N−K+1 and get the ii-th, (i+1)(i+1)-th, (i+2)(i+2)-th, ……, (i+K−1)(i+K−1)-th candy from the left.

Takahashi likes to eat colorful candies, so the more variety of colors his candies have, the happier he will be.Print the maximum possible number of distinct colors in candies he gets.