UVA 11552 Fewest Flops (序列划分DP,4级)
2013-08-28 16:47
483 查看
D - Fewest Flops
Crawling in process...
Crawling failed
Time Limit:2000MS
Memory Limit:0KB 64bit IO Format:%lld & %llu
Submit
Status
Appoint description:
System Crawler (2013-05-30)
Description
Problem F
FEWEST FLOPS
A common way to uniquely encode a string is by replacing its consecutive repeating characters (or “chunks”) by the number of times the character
occurs followed by the character itself. For example, the string “aabbbaabaaaa” may be encoded as “2a3b2a1b4a”. (Note for this problem even a single character “b” is replaced by “1b”.)
Suppose we have a string
S and a number k such that k divides the length of
S. Let S1 be the substring of
S from 1 to k, S2 be the substring of
S from k + 1 to 2k, and so on. We wish to rearrange the characters of each block
Si independently so that the concatenation of those permutations
S’ has as few chunks of the same character as possible. Output the fewest number of chunks.
For example, let
S be “uuvuwwuv” and k be 4. Then S1 is “uuvu” and has three chunks, but may be rearranged to “uuuv” which has two chunks. Similarly,
S2 may be rearranged to “vuww”. Then
S’, or S1S2, is “uuuvvuww” which is 4 chunks, indeed the minimum number of chunks.
Program Input
The input begins with a line containing
t (1 ≤ t ≤ 100), the number of test cases. The following t
lines contain an integer k and a string S made of no more than 1000 lowercase English alphabet letters. It is guaranteed that
k will divide the length of S.
Program Output
For each test case, output a single line containing the minimum number of chunks after we rearrange
S as described above.
INPUT
OUTPUT
Calgary Collegiate Programming Contest 2008
序列划分
思路:当前块有几个,最后一个是哪个
Crawling in process...
Crawling failed
Time Limit:2000MS
Memory Limit:0KB 64bit IO Format:%lld & %llu
Submit
Status
Appoint description:
System Crawler (2013-05-30)
Description
Problem F
FEWEST FLOPS
A common way to uniquely encode a string is by replacing its consecutive repeating characters (or “chunks”) by the number of times the characteroccurs followed by the character itself. For example, the string “aabbbaabaaaa” may be encoded as “2a3b2a1b4a”. (Note for this problem even a single character “b” is replaced by “1b”.)
Suppose we have a string
S and a number k such that k divides the length of
S. Let S1 be the substring of
S from 1 to k, S2 be the substring of
S from k + 1 to 2k, and so on. We wish to rearrange the characters of each block
Si independently so that the concatenation of those permutations
S’ has as few chunks of the same character as possible. Output the fewest number of chunks.
For example, let
S be “uuvuwwuv” and k be 4. Then S1 is “uuvu” and has three chunks, but may be rearranged to “uuuv” which has two chunks. Similarly,
S2 may be rearranged to “vuww”. Then
S’, or S1S2, is “uuuvvuww” which is 4 chunks, indeed the minimum number of chunks.
Program Input
The input begins with a line containing
t (1 ≤ t ≤ 100), the number of test cases. The following t
lines contain an integer k and a string S made of no more than 1000 lowercase English alphabet letters. It is guaranteed that
k will divide the length of S.
Program Output
For each test case, output a single line containing the minimum number of chunks after we rearrange
S as described above.
INPUT
2 5 helloworld 7 thefewestflops
OUTPUT
8 10
Calgary Collegiate Programming Contest 2008
序列划分
思路:当前块有几个,最后一个是哪个
#include<iostream> #include<cstring> #include<cstdio> #define FOR(i,a,b) for(int i=a;i<=b;++i) #define clr(f,z) memset(f,z,sizeof(f)) using namespace std; const int mm=1e3+9; const int oo=0x3f3f3f; int dp[mm][27],has[mm][27],pos; char s[mm]; int main() { int cas,K; while(~scanf("%d",&cas)) { while(cas--) { pos=0; scanf("%d%s",&K,s); int len=strlen(s); clr(has,0);clr(dp,0x3f); FOR(i,1,len) { if(i%K==1||K==1)++pos; ++has[pos][s[i-1]-'a']; } FOR(i,0,25)dp[0][i]=1; int num; FOR(i,1,pos) { FOR(j,0,25) {int&ret=dp[i][j]; num=0; if(has[i][j]==0)continue; FOR(k,0,25) if(has[i][k])++num; FOR(k,0,25) if(has[i][k]&&k!=j) ret=min(ret,num-1+dp[i-1][k]); else if(num==1&&k==j)ret=min(ret,dp[i-1][k]); else ret=min(ret,num+dp[i-1][k]); } } int ans=oo; FOR(i,0,25)ans=min(ans,dp[pos][i]); printf("%d\n",ans); } } return 0; }
相关文章推荐
- UVA 11552 Fewest Flops (序列划分DP,4级)
- UVA 11552 Fewest Flops(序列划分dp)
- UVA 11552 序列划分模型 状态设计DP
- UVA-11552-Fewest Flops(DP 序列划分)
- UVALive 2031 Dance Dance Revolution (舞步转移,状态压缩DP,4级)
- hdu 4604 Deque(DP递增递减序列,4级)
- UVa 11404 - Palindromic Subsequence (最长回文子序列 DP)
- UVALive 2031 Dance Dance Revolution (舞步转移,状态压缩DP,4级)
- UVA 11404 Palindromic Subsequence (去除字符DP,4级)
- UVALive 3363 String Compression (区间DP,4级)
- (UVA - 11584) Partitioning by Palindromes(DP,划分的最小回文串个数)
- Is Bigger Smarter?+uva+简单dp(最长公共升降子序列的变形)
- UVA 11404 Palindromic Subsequence (去除字符DP,4级)
- UVALive 3363 String Compression (区间DP,4级)
- UVa 103 Stacking Boxes 堆砌盒子(DP 最长条件子序列)
- uva11584 dp最少回文串划分
- UVa 11584 划分回文串( 简单dp )
- UVA 11584 或 BNU20002 划分成回文串 DP求一个串最少能划分成多少个文回串
- UVA - 1625 Color Length[序列DP 提前计算代价]
- UVALive 2038 Strategic game (树形DP,4级)