http://codeforces.com/contest/1090/problem/M
水一发
#include<iostream>
#include<cstring>
#include<cstdio>
#include<algorithm>
#include<vector>
#include<set>
#include<map>
#include<queue>
#include<cmath>
#define ll long long
#define mod 1000000007
#define inf 0x3f3f3f3f
using namespace std;
#define ll long long
int a[100005];
int cnt;
void init()
{
cnt = 0;
}
int main()
{
int n, k;
scanf("%d%d",&n,&k);
for(int i = 1; i <= n; i ++)
scanf("%d",&a[i]);
int maxy = -1;
for(int i = 1; i <= n; i ++)
{
if(a[i] != a[i-1])
{
cnt ++;
}
else
{
maxy = max(maxy, cnt);
cnt = 1;
}
maxy = max(maxy, cnt);
}
printf("%d\n", maxy);
return 0;
}