fork download
  1. #include <bits/stdc++.h>
  2. #define int long long
  3. using namespace std;
  4. signed main() {
  5. string s;
  6. cin >> s;
  7. int n = s.size();
  8. int hai[n+1],tam[n+1];
  9. hai[0]=0;
  10. tam[0]=0;
  11. for (int i = 0; i < n; i++) {
  12. int c = s[i] - '0';
  13. hai[i + 1] = hai[i] + min(abs(c - 2),12-c);
  14. tam[i + 1] = tam[i] + min(abs(c - 8),c+2);
  15. }
  16.  
  17. int ans = LLONG_MAX;
  18. for (int i = 0; i <= n; i++) {
  19. ans = min(ans, hai[i] + tam[n] - tam[i]);
  20. }
  21.  
  22. cout << ans << endl;
  23. return 0;
  24. }
  25.  
Success #stdin #stdout 0s 5304KB
stdin
5433
stdout
7