非递减序列 - Problem

#7195. 非递减序列

Statistics

This problem is prepared by ftiasch .

AI Translation — This statement was translated using AI and may contain inaccuracies. Please refer to the original statement if in doubt.

Bobo 擅长解决最长非降子序列问题，因此他喜欢寻找更多相关问题。

Bobo 想要计算满足 $0 \le x_i \le a_i$ 且 $x_1 \le x_2 \le \dots \le x_n$ 的非降序列 $(x_1, x_2, \dots, x_n)$ 的数量，其中给定序列 $(a_1, a_2, \dots, a_n)$。

输入格式

第一行包含一个整数 $n$ ($1 \le n \le 2000$)。

第二行包含 $n$ 个整数 $a_1, a_2, \dots, a_n$ ($0 \le a_i \le 10^9$)。

输出格式

输出一个整数，表示非降序列的数量对 $2017$ 取模的结果。

样例

样例输入 1

2
1 1

样例输出 1

样例输入 2

3
1 2 4

样例输出 2

Discussions

About Discussions

The discussion section is only for posting: General Discussions (problem-solving strategies, alternative approaches), and Off-topic conversations.

This is NOT for reporting issues! If you want to report bugs or errors, please use the Issues section below.

Open Discussions 0

No discussions in this category.

Issues

About Issues

If you find any issues with the problem (statement, scoring, time/memory limits, test cases, etc.), you may submit an issue here. A problem moderator will review your issue.

Guidelines:

This is not a place to publish discussions, editorials, or requests to debug your code. Issues are only visible to you and problem moderators.
Do not submit duplicated issues.
Issues must be filed in English or Chinese only.

Active Issues 0

No issues in this category.

Closed/Resolved Issues 0