{"trustable":false,"prependHtml":"\u003cstyle type\u003d\u0027text/css\u0027\u003e\n .input, .output {\n border: 1px solid #888888;\n }\n .output {\n margin-bottom: 1em;\n position: relative;\n top: -1px;\n }\n .output pre, .input pre {\n background-color: #EFEFEF;\n line-height: 1.25em;\n margin: 0;\n padding: 0.25em;\n }\n \u003c/style\u003e\n \u003clink rel\u003d\"stylesheet\" href\u003d\"//codeforces.org/s/96598/css/problem-statement.css\" type\u003d\"text/css\" /\u003e\n\u003cscript\u003e\n window.katexOptions \u003d {\n delimiters: [\n {left: \u0027$$$$$$\u0027, right: \u0027$$$$$$\u0027, display: true},\n {left: \u0027$$$\u0027, right: \u0027$$$\u0027, display: false},\n {left: \u0027$$\u0027, right: \u0027$$\u0027, display: true},\n {left: \u0027$\u0027, right: \u0027$\u0027, display: false}\n ]\n };\n\u003c/script\u003e\n","sections":[{"title":"","value":{"format":"MD","content":"常武皮革厂报名评比全国文明好工厂,上头委托特约观察员小明来厂里观察,工厂颜值协会赶紧从金库里面拨了笔款种了一排花里胡哨的树,然而百密一疏,小明是个精致的利己主义者,他在知乎上看过连续两棵树种同一个品种是弟弟行为,于是小明特别喜欢连续两棵树是不同品种,因此小明建立的一个打分制度,看一排树能得多少分,就看这排树最多连续几棵树保证相邻品种都不同。万恶的观察员小明来打分了,我们的常武皮革厂能得几分呢……"}},{"title":"Input","value":{"format":"MD","content":"第一行,输入两个整数 n 和 k,n 代表一排有 n 棵的树,k 代表一共有 k 种树\n(1≤n≤100000, 1≤k≤100000).\n第二行,输入 n 个整数,第 i 个数代表第 i 棵树是什么品种"}},{"title":"Output","value":{"format":"MD","content":"一个整数,我们的常武皮革厂能得几分"}},{"title":"Example","value":{"format":"MD","content":"input\n9 4\n3 2 4 4 2 1 2 2 2\noutput\n4"}},{"title":"Note","value":{"format":"MD","content":"样例中有 9 棵树,有 4 个品种,其中“4 2 1 2”连续 4 棵树相邻品种不同,故得 4 分"}}]}