#include <cstdio> #include <cstring> void int2string(long long int x, char* tab, int& len) { len = 0; while (x) { tab[len++] = '0' + x % 10; x /= 10; } tab[len] = '\0'; for (int i = 0; i < len/2; i++) { char t = tab[i]; tab[i] = tab[len - 1 - i]; tab[len - 1 - i] = t; } } int main() { const long long int STOP = 1000000000000000LL; char prev_tab[65], cur_tab[65]; int n, result = 0; long long int prev = 0; long long int a; int prev_len, cur_len; scanf("%d", &n); for (int ij = 0; ij < n; ij++) { scanf("%lld", &a); if (prev < STOP) { if (a > prev) { prev = a; continue; } int2string(prev, prev_tab, prev_len); int2string(a, cur_tab, cur_len); if (prev_len == cur_len) { a *= 10; prev = a; prev_len++; result++; continue; } bool samePrefix = true; int k = 0; for (; k < cur_len; k++) { if (prev_tab[k] != cur_tab[k]) { samePrefix = false; break; } } if (samePrefix) { bool only9 = true; for (int i = k; i < prev_len; i++) { if (prev_tab[i] != '9') { only9 = false; } } if (!only9) { prev++; result += (prev_len - cur_len); } else { while (a < prev) { a *= 10; result++; } prev = a; prev_len++; } } else if (prev_tab[k] > cur_tab[k]) { while (a < prev) { a *= 10; result++; } prev = a; prev_len++; } else { while (a < prev) { a *= 10; result++; } prev = a; } } else { int dlup, dluc; //int2string(prev, prev_tab, dlup); int2string(a, cur_tab, dluc); bool ext = false, gr = false; for (int i = 0; i < dluc; i++) { if (!gr && prev_tab[i] > cur_tab[i]) { ext = true; } else if (prev_tab[i] < cur_tab[i]) { gr = true; } prev_tab[i] = cur_tab[i]; } for (int i = dluc; i < 60; i++) { prev_tab[i] = '0'; } prev_tab[60] = '\0'; if (ext) { prev_len++; } result += (prev_len - dluc); sprintf(cur_tab, "%lld", prev); } } printf("%d", result); return 0; }
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 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 | #include <cstdio> #include <cstring> void int2string(long long int x, char* tab, int& len) { len = 0; while (x) { tab[len++] = '0' + x % 10; x /= 10; } tab[len] = '\0'; for (int i = 0; i < len/2; i++) { char t = tab[i]; tab[i] = tab[len - 1 - i]; tab[len - 1 - i] = t; } } int main() { const long long int STOP = 1000000000000000LL; char prev_tab[65], cur_tab[65]; int n, result = 0; long long int prev = 0; long long int a; int prev_len, cur_len; scanf("%d", &n); for (int ij = 0; ij < n; ij++) { scanf("%lld", &a); if (prev < STOP) { if (a > prev) { prev = a; continue; } int2string(prev, prev_tab, prev_len); int2string(a, cur_tab, cur_len); if (prev_len == cur_len) { a *= 10; prev = a; prev_len++; result++; continue; } bool samePrefix = true; int k = 0; for (; k < cur_len; k++) { if (prev_tab[k] != cur_tab[k]) { samePrefix = false; break; } } if (samePrefix) { bool only9 = true; for (int i = k; i < prev_len; i++) { if (prev_tab[i] != '9') { only9 = false; } } if (!only9) { prev++; result += (prev_len - cur_len); } else { while (a < prev) { a *= 10; result++; } prev = a; prev_len++; } } else if (prev_tab[k] > cur_tab[k]) { while (a < prev) { a *= 10; result++; } prev = a; prev_len++; } else { while (a < prev) { a *= 10; result++; } prev = a; } } else { int dlup, dluc; //int2string(prev, prev_tab, dlup); int2string(a, cur_tab, dluc); bool ext = false, gr = false; for (int i = 0; i < dluc; i++) { if (!gr && prev_tab[i] > cur_tab[i]) { ext = true; } else if (prev_tab[i] < cur_tab[i]) { gr = true; } prev_tab[i] = cur_tab[i]; } for (int i = dluc; i < 60; i++) { prev_tab[i] = '0'; } prev_tab[60] = '\0'; if (ext) { prev_len++; } result += (prev_len - dluc); sprintf(cur_tab, "%lld", prev); } } printf("%d", result); return 0; } |