BZOJ3048: [Usaco2013 Jan]Cow Lineup

n<=100000个数，求删掉K种相同的数之后最长的相同数区间长度。

原来是2指针裸题。两个指针，一个左边开始扫，一个右边找最长的区间，使得数字种数不超过K+1即可，然后统计答案。

统计答案时，如果枚举左端点就用左端点更新答案，枚举右端点就用右。因为这个WA了两次。

 1 #include<stdio.h>
 2 #include<string.h>
 3 #include<stdlib.h>
 4 //#include<math.h>
 5 #include<algorithm>
 6 #include<iostream>
 7 using namespace std;
 8
 9 int n,m;
10 #define maxn 100011
11 int a[maxn],li[maxn],cnt[maxn];
12 int main()
13 {
14     scanf("%d%d",&n,&m);
15     for (int i=1;i<=n;i++) scanf("%d",&a[i]),li[i]=a[i];
16     sort(li+1,li+1+n);for (int i=1;i<=n;i++) a[i]=lower_bound(li+1,li+1+n,a[i])-li;
17     int l=1,r=1,tot=0,ans=0;
18     memset(cnt,0,sizeof(cnt));
19     for (;l<=n;l++)
20     {
21         for (;r<=n;r++)
22         {
23             if (!cnt[a[r]]) tot++;
24             if (tot>m+1) {tot--;break;}
25             cnt[a[r]]++;
26         }
27         ans=max(ans,cnt[a[l]]);
28         cnt[a[l]]--;
29         if (!cnt[a[l]]) tot--;
30     }
31     printf("%d\n",ans);
32     return 0;
33 }

View Code

转载于:https://www.cnblogs.com/Blue233333/p/7608563.html

BZOJ3048: [Usaco2013 Jan]Cow Lineup相关推荐

【BZOJ3048】Cow lineup，贪心+队列维护（或二分答案）
传送门(权限题) 题面: 3048: [Usaco2013 Jan]Cow Lineup Time Limit: 2 Sec Memory Limit: 128 MB Submit: 121 Solv ...
BZOJ 1612: [Usaco2008 Jan]Cow Contest奶牛的比赛【Floyd】
1612: [Usaco2008 Jan]Cow Contest奶牛的比赛 Time Limit: 5 Sec Memory Limit: 64 MB Description FJ的N(1 <= ...
bzoj 3377: [Usaco2004 Open]The Cow Lineup 奶牛序列
3377: [Usaco2004 Open]The Cow Lineup 奶牛序列 Time Limit: 10 Sec Memory Limit: 128 MB Submit: 49 Solve ...
bzoj 1612: [Usaco2008 Jan]Cow Contest奶牛的比赛（floyd）
1612: [Usaco2008 Jan]Cow Contest奶牛的比赛 Time Limit: 5 Sec Memory Limit: 64 MB Submit: 1153 Solved: 7 ...
bzoj 1636 bzoj 1699: [Usaco2007 Jan]Balanced Lineup排队（RMQ）
1699: [Usaco2007 Jan]Balanced Lineup排队 Time Limit: 5 Sec Memory Limit: 64 MB Submit: 1514 Solved: ...
题解洛谷 P3069 [USACO13JAN]牛的阵容Cow Lineup
洛谷P3069[USACO13JAN]牛的阵容CowLineup\color{#00F}{洛谷\ P3069\ [USACO13JAN]牛的阵容Cow Lineup}洛谷 P3069 [USACO13 ...
洛谷 3029 [USACO11NOV]牛的阵容Cow Lineup
https://www.luogu.org/problem/show?pid=3029 题目描述 Farmer John has hired a professional photographer t ...
bzoj 1699: [Usaco2007 Jan]Balanced Lineup排队【st表||线段树】
要求区间取min和max,可以用st表或线段树维护 st表 #include<iostream> #include<cstdio> using namespace std; c ...
[USACO13JAN] Cow Lineup (单调队列,尺取法)
题目链接 Solution 尺取法板子,算是复习一波. 题中说最多删除 \(k\) 种,那么其实就是找一个颜色种类最多为 \(k+1\) 的区间; 统计一下其中最多的颜色出现次数. 然后直接尺取法,然 ...

BZOJ3048: [Usaco2013 Jan]Cow Lineup

BZOJ3048: [Usaco2013 Jan]Cow Lineup相关推荐

最新文章

热门文章