temple

 1 //0110101110111011000  原来输入串11个1 -> 求反转一段01之后（且至少反转一个）所能得到最多的1个数，该例子为14
 2 
 3 #include <iostream>
 4 #include <string>
 5 #include <cstring>
 6 using namespace std;
 7 
 8 int Seek(string str){
 9     int ans = 0;
10     int maxx = -1;
11     for (int k = 0; k < str.length(); k++){
12         if (str[k] == ‘1‘)
13             ans++;
14     }
15     int tmp = 0;
16     for (int i = 0; i < str.length(); i++){
17         if (str[i] == ‘0‘){
18             tmp++;
19             if (tmp > maxx)
20                 maxx = tmp;
21         }
22         else{
23             tmp--;
24             if (tmp < 0)
25                 tmp = 0;
26         }
27     }
28     return ans + maxx;
29 }
30 
31 int main (){
32     string s;
33     cin >> s;
34     cout << Seek(s);
35 }