博客介绍了HDOJ 5534问题的解决方案，重点在于如何构造满足特定条件的字符串。对于小于10^5的情况，直接输出1，而大于10^5的字符串需遵循特定格式，如111...222...333...到t,t+1,t+2等。通过设定每个字符的出现次数L[i]，满足公式n*n+n-sigma(L[i])=2*K，估算字符串长度n，并使用贪心算法确定L[i]的具体值，从而实现虚拟参与的概念。"
108348155,9549694,区块链在军事人力资源配置中的应用,"['区块链', '大数据', '军事技术', '人力资源管理']
构造
小于10^5的直接输出1
大于10^5的构造如下的串
1111...12222...233....3.....t,t+1,t+2..
设长度为n,每种字符出现了L[i]次则不同的串有 n*n+n-sigma(L[i])=2*K
大约估计一个n,用贪心求出L
Virtual Participation
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 711 Accepted Submission(s): 205
Special Judge
Problem Description
As we know, Rikka is poor at math. Yuta is worrying about this situation, so he asks rikka to have some practice on codeforces. Then she opens the problem B:
Given an integer K , she needs to come up with an sequence of integers A satisfying that the number of different continuous subsequence of A is equal to k .
Two continuous subsequences a, b
Given an integer K , she needs to come up with an sequence of integers A satisfying that the number of different continuous subsequence of A is equal to k .
Two continuous subsequences a, b
最低0.47元/天 解锁文章
扫一扫
773
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
