http://poj.org/problem?id=1989 题意:求一个序列的最短非子序列长度l,即长度小于l的所有数的排列都是原序列的子序列(不一定要连续的),求l得最小值. 分析: 我们从左到右扫一遍,将所有包含1..k的分为一组,ans=组数+1 如样例:(1,5,3,2,5,1,3,4)(4,2,5,1,2,3)[],故ans=3 简单的说明就是可以从每组中抽出一个数作成排列,然后发现的确ans=组数+1是最小的满足的…

一道非常神奇的题目 var v:array[0..10010] of boolean; n,k,i,x,ans,s:longint; begin readln(n,k); fillchar(v,sizeof(v),false); ans:=1; for i:=1 to n do begin readln(x); if not v[x] then begin inc(s); if s=k then begin fillchar(v,sizeof(v),false); inc(ans); s:=0;…

The Cow Lineup Time Limit: 1000MS Memory Limit: 30000K Total Submissions: 5587 Accepted: 3311 Description Farmer John's N cows (1 <= N <= 100,000) are lined up in a row.Each cow is labeled with a number in the range 1-K (1 <= K <=10,000) ident…

POJ题目分类 | POJ题目分类 | HDU题目分类 | ZOJ题目分类 | SOJ题目分类 | HOJ题目分类 | FOJ题目分类 | 模拟题: POJ1006 POJ1008 POJ1013 POJ1016 POJ1017 POJ1169 POJ1298 POJ1326 POJ1350 POJ1363 POJ1676 POJ1786 POJ1791 POJ1835 POJ1970 POJ2317 POJ2325 POJ2390 POJ1012 POJ1082 POJ1099 POJ1114…