fork download
  1. #include <bits/stdc++.h>
  2. using namespace std;
  3. #define int long long int
  4. #define double long double
  5. #define print(a) for(auto x : a) cout << x << " "; cout << endl
  6.  
  7.  
  8. const int M = 1000000007;
  9. const int N = 3e5+9;
  10. const int INF = 2e9+1;
  11. const int LINF = 2000000000000000001;
  12.  
  13. inline int power(int a, int b, int mod=M) {
  14. int x = 1;
  15. a %= mod;
  16. while (b) {
  17. if (b & 1) x = (x * a) % mod;
  18. a = (a * a) % mod;
  19. b >>= 1;
  20. }
  21. return x;
  22. }
  23.  
  24.  
  25. //_ ***************************** START Below *******************************
  26.  
  27. // aabbaba
  28.  
  29.  
  30. string a;
  31.  
  32. int consistency(int n){
  33.  
  34. vector<int> sA(n+1);
  35. vector<int> sB(n+1);
  36.  
  37. for(int i=n-1; i>=0; i--){
  38. sA[i] = sA[i+1];
  39. sB[i] = sB[i+1];
  40.  
  41. if(a[i] == 'a') sA[i]++;
  42. else sB[i]++;
  43. }
  44.  
  45. int ans = n;
  46.  
  47. int aa = 0;
  48. int bb = 0;
  49. for(int i=0; i<n; i++){
  50. if(a[i] == 'a') aa++;
  51. else bb++;
  52.  
  53. int cost1 = aa + sB[i+1];
  54. int cost2 = bb + sA[i+1];
  55.  
  56. int cost = min(cost1, cost2);
  57.  
  58. ans = min(ans, cost);
  59. }
  60.  
  61. return ans;
  62. }
  63.  
  64.  
  65.  
  66.  
  67.  
  68.  
  69.  
  70.  
  71.  
  72.  
  73.  
  74.  
  75.  
  76.  
  77.  
  78. int practice(int n){
  79.  
  80.  
  81. return 0;
  82. }
  83.  
  84.  
  85.  
  86.  
  87.  
  88. void solve() {
  89.  
  90. int n;
  91.  
  92. cin >> a;
  93. n = a.size();
  94.  
  95. cout << consistency(n) << endl;
  96.  
  97.  
  98. }
  99.  
  100.  
  101.  
  102.  
  103.  
  104. int32_t main() {
  105. ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
  106.  
  107. int t = 1;
  108. // cin >> t;
  109. while (t--) {
  110. solve();
  111. }
  112.  
  113. return 0;
  114. }
Success #stdin #stdout 0s 5320KB
stdin
aabbaba
stdout
2