#include <cstdio> #include <vector> using namespace std; #define FOR(i,a,b) for(int i=(a);i<(b);++i) #define FORD(i,a,b) for(int i=(b)-1;i>=(a);--i) #define REP(i,n) FOR(i,0,n) #define REPD(i,n) FORD(i,0,n) #define VAR(v,w) __typeof(w) v=(w) #define FORE(it,c) for(VAR(it,(c).begin());it!=(c).end();++it) #define PB push_back #define SIZE(c) ((int)(c).size()) #define INT(x) int x; scanf("%d", &x) typedef long long LL; typedef vector<int> VI; struct Num { VI low, high; int off; int len() { return off + SIZE(high); } int operator[](int i) { if (i >= off) return high[i - off]; else if (i < SIZE(low)) return low[i]; else return 0; } VI indr() { VI r; REPD(i,SIZE(high)) r.PB(i + off); REPD(i,SIZE(low)) r.PB(i); return r; } void operator++() { int i = 0; while (i < SIZE(low) && low[i] == 9) low[i++] = 0; if (i < SIZE(low)) { ++low[i]; return; } if (i < off) { low.PB(1); return; } i = 0; while (i < SIZE(high) && high[i] == 9) high[i++] = 0; if (i < SIZE(high)) { ++high[i]; return; } high.PB(1); } }; VI merger(const VI& v, const VI& w) { VI r; int i = 0, j = 0; while (i < SIZE(v) || j < SIZE(w)) { if (i == SIZE(v)) r.PB(w[j++]); else if (j == SIZE(w)) r.PB(v[i++]); else if (v[i] > w[j]) r.PB(v[i++]); else if (v[i] < w[j]) r.PB(v[i++]); else { ++i; r.PB(w[j++]); } } return r; } int main() { INT(n); Num last; last.off = 0; LL r = 0; REP(i,n) { INT(a); VI v; while (a) { v.PB(a % 10); a /= 10; } Num x; x.high = v; x.off = 0; int k = last.len(); if (x.len() > k) { last = x; continue; } x.off = k - x.len(); int diff = -1; VI inds = merger(x.indr(), last.indr()); FORE(it,inds) { if (x[*it] != last[*it]) { diff = *it; break; } } if (diff >= 0 && x[diff] > last[diff]) { last = x; r += k - SIZE(v); continue; } ++last; bool ok = last.len() == k; if (ok) { inds = x.indr(); FORE(it,inds) if (x[*it] != last[*it]) { ok = 0; break; } } if (ok) { r += k - SIZE(v); continue; } ++x.off; last = x; r += k + 1 - SIZE(v); } printf("%lld\n", r); }
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 | #include <cstdio> #include <vector> using namespace std; #define FOR(i,a,b) for(int i=(a);i<(b);++i) #define FORD(i,a,b) for(int i=(b)-1;i>=(a);--i) #define REP(i,n) FOR(i,0,n) #define REPD(i,n) FORD(i,0,n) #define VAR(v,w) __typeof(w) v=(w) #define FORE(it,c) for(VAR(it,(c).begin());it!=(c).end();++it) #define PB push_back #define SIZE(c) ((int)(c).size()) #define INT(x) int x; scanf("%d", &x) typedef long long LL; typedef vector<int> VI; struct Num { VI low, high; int off; int len() { return off + SIZE(high); } int operator[](int i) { if (i >= off) return high[i - off]; else if (i < SIZE(low)) return low[i]; else return 0; } VI indr() { VI r; REPD(i,SIZE(high)) r.PB(i + off); REPD(i,SIZE(low)) r.PB(i); return r; } void operator++() { int i = 0; while (i < SIZE(low) && low[i] == 9) low[i++] = 0; if (i < SIZE(low)) { ++low[i]; return; } if (i < off) { low.PB(1); return; } i = 0; while (i < SIZE(high) && high[i] == 9) high[i++] = 0; if (i < SIZE(high)) { ++high[i]; return; } high.PB(1); } }; VI merger(const VI& v, const VI& w) { VI r; int i = 0, j = 0; while (i < SIZE(v) || j < SIZE(w)) { if (i == SIZE(v)) r.PB(w[j++]); else if (j == SIZE(w)) r.PB(v[i++]); else if (v[i] > w[j]) r.PB(v[i++]); else if (v[i] < w[j]) r.PB(v[i++]); else { ++i; r.PB(w[j++]); } } return r; } int main() { INT(n); Num last; last.off = 0; LL r = 0; REP(i,n) { INT(a); VI v; while (a) { v.PB(a % 10); a /= 10; } Num x; x.high = v; x.off = 0; int k = last.len(); if (x.len() > k) { last = x; continue; } x.off = k - x.len(); int diff = -1; VI inds = merger(x.indr(), last.indr()); FORE(it,inds) { if (x[*it] != last[*it]) { diff = *it; break; } } if (diff >= 0 && x[diff] > last[diff]) { last = x; r += k - SIZE(v); continue; } ++last; bool ok = last.len() == k; if (ok) { inds = x.indr(); FORE(it,inds) if (x[*it] != last[*it]) { ok = 0; break; } } if (ok) { r += k - SIZE(v); continue; } ++x.off; last = x; r += k + 1 - SIZE(v); } printf("%lld\n", r); } |