As we are currently experiencing an overwhelming number of web requests for fetching user submissions, we have temporarily disabled the full submissions list. You must now be logged in to view submissions.
给定两个序列 $a_1,\dots,a_n$，$b_1,\dots,b_n$，一开始 $b_i=0$；
你需要进行 $m$ 次操作：
每次操作，给出 $l,r,L$，需要对于$k\in[l,r]$，将 $b_{L+k-l}$ 增加 $a_k$；
最后输出经过所有操作后的序列 $b_1,\dots,b_n$。
第一行一个整数 $n$；
第二行 $n$ 个整数 $a_1,\dots,a_n$；
第三行一个整数 $m$；
之后 $m$ 行每行三个整数 $l\;r\;L$，表示一个询问。
输出 $n$ 行，表示操作后的 $b_1,\dots,b_n$。
3
1 2 3
1
1 2 20
1
2Idea：nzhtl1477，Solution：ccz181078，Code：ccz181078，Data：ccz181078
对于 $100\%$ 的数据满足 $0\le a_i\le 1000$；$1\le n\le 10^5$；$1\le m\le 10^6$。
The discussion section is only for posting: Editorials, 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.
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: