CodeForces - 1363B
題意:輸入一個只有1和0的字串,將此字串變成11111110000000或0000000001111111型的最小改變數。
思路:比如一個字串長為5,那就列舉變為01111、00111、00011、00001、00000、10000、11000、11100、11110、11111.每個最小改變數即可。只要知道思路,程式碼不難。但是這思路怎麼想到呢!!!難啊
#include <bits/stdc++.h>
using namespace std;
int main()
{
int t;
cin>>t;
while(t--){
string s;
cin>>s;
int mm=2147483645;
int len=s.length();
for(int i=0;i<len;i++){
int sum=0;
for(int j=0;j<i;j++){
if(s[j]!='1') sum++;
}
for(int j=i;j<len;j++){
if(s[j]!='0') sum++;
}
mm=min(mm,sum);
}
for(int i=0;i<len;i++){
int sum=0;
for(int j=0;j<i;j++){
if(s[j]!='0') sum++;
}
for(int j=i;j<len;j++){
if(s[j]!='1') sum++;
}
mm=min(mm,sum);
}
cout<<mm<<endl;
}
}
相關文章
- codeforces Mafia
- codeforces Winner
- codeforces Educational Codeforces Round 33 (Rated for Div. 2)
- codeforces Educational Codeforces Round 33 (Rated for Div. 2)B
- codeforces Photo of The Sky
- Codeforces - Jzzhu and Numbers
- codeforces #442 B
- Codeforces Sereja and Array
- Codeforces Round #174
- Codeforces Round #170
- Codeforces 專區
- Codeforces Global Round 13
- codeforces_B. Barnicle
- CodeForces 1307
- Educational Codeforces Round 32
- Codeforces Beta Round #32
- Codeforces Beta Round #23
- Codeforces Round #180
- codeforces比賽日記
- Codeforces Educational Round#98 A
- codeforces #313(div 2)
- Educational Codeforces Round 1 Tutorial
- Codeforces #245(div2)
- codeforces Vasya and Digital RootGit
- Educational Codeforces Round 163
- Codeforces 452F Permutation
- Codeforces C. Colored Rooks 構造 (Codeforces Round #518 (Div. 2) )
- 【CodeForces】 Codeforces Round #672 (Div. 2) B.Rock and Lever (思維&位運算)
- Codeforces Round #639 (Div. 2)
- Kefa and Company Codeforces#321
- Pasha and Stick Codeforces 610A
- Uncowed Forces Codeforces Round #334
- Codeforces Round #541 (Div. 2)
- codeforces_1131_D
- Codeforces 346A Alice and Bob
- 「 CodeForces」10E Greedy Change
- Codeforces Round #690 (Div. 3)
- Codeforces Round #682 (Div. 2)