{"trustable":false,"sections":[{"title":"","value":{"format":"HTML","content":"一个序列由不超过88的数字组成,我们将其差分之后得到差分数组\n差分数组:\n对于任意n\u003ei\u003e\u003d1,差分数组中cha[i]\u003da[i]-a[i-1]\n求差分数组中存在的长度不小于4,出现次数不小于两次,且出现部分不重合的最长数组长度"}},{"title":"Input","value":{"format":"HTML","content":"循环输入\n每个样例第一行输入一个n,表示数组长度\n第二行包括n个不超过88的数字"}},{"title":"Output","value":{"format":"HTML","content":"求满足要求的最长子串的长度"}},{"title":"Sample Input","value":{"format":"HTML","content":"\u003cpre class\u003d\"sio\"\u003e30\n25 27 30 34 39 45 52 60 69 79 69 60 52 45 39 34 30 26 22 18\n82 78 74 70 66 67 64 60 65 80\n11\n1 1 1 1 1 6 6 6 6 6 5\n17\n1 2 3 4 5 6 7 8 9 8 7 6 5 4 3 2 1\n0\n\u003c/pre\u003e"}},{"title":"Sample Output","value":{"format":"HTML","content":"\u003cpre class\u003d\"sio\"\u003e5\n5\n5\n\u003c/pre\u003e"}},{"title":"Hint","value":{"format":"HTML","content":"\u003cdiv class\u003d\"ptx\" lang\u003d\"en-US\"\u003e请使用快读,而不是scanf,减少读取时间\u003c/div\u003e"}}]}