UVa Problem Solution: 10049 - Self-describing Sequence

Let g(n) denote the n'th number that satifies f(k) > f(k-1). We can know that
    g(0) = 1, g(1) = 2, g(2) = 4, ...
From the definition of g(n), we can know that all the values of f(k) where k belongs to the range of [g(n-1), g(n)) is n. Since there are exactly f(k) occurrences of k in the sequence, there must be  f(1) + f(2) + ... + f(f(k)-1) elements before f(k) if f(k) > f(k-1). Thus, we can know that
    g(n) = f(1) + f(2) + ... + f(f(k)-1) + 1.
In fact f(k)-1 == n, so we have
    g(n) = f(1) + f(2) + ... + f(n) + 1.
Also, we can draw a simple recurrence of
    g(n) = g(n-1) + f(n).
We have already known that the values of f(k) in the range of [g(n-1), g(n)) is n. So we can compute g(n) in this way:
   1. Let g(1) = 2, g(2) = 4, i = 1
   2. for n in [g(i), g(i+1)), we know f(n) = i+1, so we can compute g(n) with
         g(n) = g(n-1) + (i+1)
   3. i = i+1, repeat 2 util g(n) is big enough.

Code:

1. /***************************************************************************
2.  *   Copyright (C) 2008 by Liu Kaipeng                                     *
3.  *   LiuKaipeng at gmail dot com                                           *
4.  ***************************************************************************/
6. /* @JUDGE_ID 00000 10049 C++ "Self-describing Sequence" */
8. #include <algorithm>
9. #include <cmath>
10. #include <cstdio>
11. #include <cstring>
12. #include <deque>
13. #include <fstream>
14. #include <iostream>
15. #include <list>
16. #include <map>
17. #include <queue>
18. #include <set>
19. #include <stack>
20. #include <string>
21. #include <vector>
23. using namespace std;
25. /*
26.  * Let g(n) denote the n'th number that satifies f(k) > f(k-1). We can know that
27.  * g(0) = 1, g(1) = 2, g(2) = 4, ... From the definition of g(n), we can know 
28.  * that all the values of f(k) where k belongs to the range of [g(n-1), g(n)) is n.
29.  * Since there are exactly f(k) occurrences of k in the sequence, there must be 
30.  * f(1) + f(2) + ... + f(f(k)-1) elements before f(k) if f(k) > f(k-1). Thus, we can
31.  * know that g(n) = f(1) + f(2) + ... + f(f(k)-1) + 1. In fact f(k)-1 == n, so we
32.  * have g(n) = f(1) + f(2) + ... + f(n) + 1. Also, we can draw a simple recurrence of
33.  *   g(n) = g(n-1) + f(n).
34.  * We have already known that the values of f(k) in the range of [g(n-1), g(n)) is n.
35.  * So we can compute g(n) in this way:
36.  * 1. Let g(1) = 2, g(2) = 4, i = 1
37.  * 2. for n in [g(i), g(i+1)), we know f(n) = i+1, so we can compute g(n) with 
38.  *      g(n) = g(n-1) + (i+1)
39.  * 3. i = i+1, repeat 2 util g(n) is big enough.
40.  */
41. int numbers[700000];
42. int size = 0;
43. void gen_numbers()
44. {
45.   int const max_number = 2000000000;
46.   numbers[0] = 1;
47.   numbers[1] = 2;
48.   numbers[2] = 4;
49.   int i = 1;
50.   for (; numbers[numbers[i]-1] < max_number; ++i)
51.     for (int j = numbers[i]; j < numbers[i+1]; ++j)
52.       numbers[j] = numbers[j-1] + i + 1; 
53.   size = numbers[i] - 1;
54. }
56. int main(int argc, char *argv[])
57. {
58. #ifndef ONLINE_JUDGE
59.   freopen((string(argv[0]) + ".in").c_str(), "r", stdin);
60.   freopen((string(argv[0]) + ".out").c_str(), "w", stdout);
61. #endif
63.   gen_numbers();
64.   for (int n; cin >> n && n != 0; )
65.     cout << upper_bound(numbers, numbers + size, n) - numbers << '/n';
67.   return 0;
68. }