#include <iostream> #include <cmath> using namespace std; using ll = long long; const int MAXN = 2e5 + 5; const ll INF = 1e18; int len[MAXN], lena[MAXN]; ll a[MAXN], b[MAXN], p[25]; int dig(ll a) { int ctr = 0; while (a) { ctr++; a /= 10; } return ctr; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); p[0] = 1; for (int i = 1; i < 20; i++) { p[i] = p[i - 1] * 10; } int n; cin >> n; for (int i = 0; i < n; i++) { cin >> a[i]; lena[i] = len[i] = dig(a[i]); } b[0] = a[0]; for (int i = 1; i < n; i++) { if (a[i] > b[i - 1]) { b[i] = a[i]; } else if (a[i] == b[i - 1]) { b[i] = a[i] * 10; len[i]++; } else { int k = dig(b[i - 1]) - lena[i]; ll pref = b[i - 1] / p[k]; if (a[i] > pref) { b[i] = a[i]; len[i] = len[i - 1]; } else if (a[i] == pref) { ll suf = b[i - 1] - pref * p[k]; if (suf == p[k] - 1) { b[i] = a[i]; len[i] = len[i - 1] + 1; } else { b[i] = b[i - 1] + 1; len[i] = len[i - 1]; } } else { b[i] = a[i]; len[i] = len[i - 1] + 1; } } while (b[i] < p[min(17, len[i] - 1)]) { b[i] *= 10; } } ll res = 0; for (int i = 0; i < n; i++) { res += (len[i] - lena[i]); } cout << res << "\n"; }
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 | #include <iostream> #include <cmath> using namespace std; using ll = long long; const int MAXN = 2e5 + 5; const ll INF = 1e18; int len[MAXN], lena[MAXN]; ll a[MAXN], b[MAXN], p[25]; int dig(ll a) { int ctr = 0; while (a) { ctr++; a /= 10; } return ctr; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); p[0] = 1; for (int i = 1; i < 20; i++) { p[i] = p[i - 1] * 10; } int n; cin >> n; for (int i = 0; i < n; i++) { cin >> a[i]; lena[i] = len[i] = dig(a[i]); } b[0] = a[0]; for (int i = 1; i < n; i++) { if (a[i] > b[i - 1]) { b[i] = a[i]; } else if (a[i] == b[i - 1]) { b[i] = a[i] * 10; len[i]++; } else { int k = dig(b[i - 1]) - lena[i]; ll pref = b[i - 1] / p[k]; if (a[i] > pref) { b[i] = a[i]; len[i] = len[i - 1]; } else if (a[i] == pref) { ll suf = b[i - 1] - pref * p[k]; if (suf == p[k] - 1) { b[i] = a[i]; len[i] = len[i - 1] + 1; } else { b[i] = b[i - 1] + 1; len[i] = len[i - 1]; } } else { b[i] = a[i]; len[i] = len[i - 1] + 1; } } while (b[i] < p[min(17, len[i] - 1)]) { b[i] *= 10; } } ll res = 0; for (int i = 0; i < n; i++) { res += (len[i] - lena[i]); } cout << res << "\n"; } |