Firstly, we could construct a sequence of positive integers with 1017 terms $a_1, a_2, \dots, a_{1017}$, such that we cannot find consecutive terms whose sum is 30. Hence, we could set $a_1 = a_2 = \cdots = a_{29} = 1$, $a_{30} = 31$ and $a_{30+m+i} = a_i$, $i \in \{1, 2, \dots, 30\}$, $m \in \mathbb{N}$, which means the sequence is 1, 1, \dots, 1, 31, $|1, 1, \dots, 1, 31, \dots, 1, 1, \dots, 1, 31, \dots|$, 1, \dots, 1 (in which there are 34 groups all have 30 terms except the last group with 27 terms, totalling 1017 terms).

Secondly, when the terms are less than 1017, what we should do is just to combine several consecutive terms into a larger number within certain groups of the sequence.

Now, for any sequence with 1018 terms $a_1, a_2, \dots, a_{1018}$ that satisfies the condition $\sum_{i=1}^{1018} a_i = 2007$, we want to prove that there must exist several consecutive terms whose sum is 30.

Denote $S_k = \sum_{i=1}^{k} a_i$, $k = 1, 2, \dots, 1018$, then
$1 \le S_1 < S_2 < \cdots < S_{1018} = 2007.$

Group the elements in the set $\{1, 2, \dots, 2007\}$ as follows:

(1, 31), (2, 32), ..., (30, 60);
(61, 91), (62, 92), ..., (90, 120);
(121, 151), (122, 152), ..., (150, 180);
......
(60k + 1, 60k + 31), (60k + 2, 60k + 32), ..., (60k + 30, 60k + 1);
......
(60 \cdot 32 + 1, 60 \cdot 32 + 31), (60 \cdot 32 + 2, 60 \cdot 32 + 32), ..., (60 \cdot 32 + 30, 60 \cdot 33);
1981, 1982, ..., 2007.

There are $33 \times 30 = 990$ brackets and 27 numbers without brackets. Arbitrarily take 1018 numbers, whose sum is the value of $S_k$. There must be two numbers from the same bracket. Denote the two numbers by $(S_k, S_{k+m})$, then $S_{k+m} - S_k = 30$, which means,
$$a_{k+1} + a_{k+2} + \cdots + a_{k+m} = 30.$$
Therefore, the minimum of $n$ is 1018.