import java.util.Scanner;

public class Main { public static void main(String[] args) { Scanner input = new Scanner(System.in); String s = input.nextLine(); int n = s.length(); int[] idxs = new int[n]; int count = 0; for (int i = 0; i < n-2; i++) { if (s.substring(i, i+3).equals("110")) { idxs[count] = i; count++; } } int ans = 0; for (int i = 1; i < count-1; i++) { ans = Math.max(ans, idxs[i]-idxs[i-1]+1); } ans = Math.max(ans, idxs[0]+2); ans = Math.max(ans, n-idxs[count-1]-1); System.out.println(ans); }

package mainimport 	bufio	fmt	osfunc main 	in out = bufioNewReaderosStdin bufioNewWriterosStdout	defer outFlush	var s string	fmtFscanin &s	s = 1101010110010110	n = lens	idxs = int	for i = 0; i n-2; i

原文地址: https://www.cveoy.top/t/topic/iZ3j 著作权归作者所有。请勿转载和采集!

免费AI点我,无需注册和登录