A11225 | Mahmoud and Ehab and the function
时间限制1s
内存限制256MB
通过 / 提交0/0
题目描述
Dr. Evil is interested in math and functions, so he gave Mahmoud and Ehab array $a$ of length $n$ and array $b$ of length $m$ . He introduced a function $f(j)$ which is defined for integers $j$ , which satisfy $0<=j<=m-n$ . Suppose, $c_{i}=a_{i}-b_{i+j}$ . Then $f(j)=|c_{1}-c_{2}+c_{3}-c_{4}...\ c_{n}|$ . More formally, .
Dr. Evil wants Mahmoud and Ehab to calculate the minimum value of this function over all valid $j$ . They found it a bit easy, so Dr. Evil made their task harder. He will give them $q$ update queries. During each update they should add an integer $x_{i}$ to all elements in $a$ in range $[l_{i};r_{i}]$ i.e. they should add $x_{i}$ to $a_{li},a_{li}+1,...\ ,a_{ri}$ and then they should calculate the minimum value of $f(j)$ for all valid $j$ .
Please help Mahmoud and Ehab.
Dr. Evil wants Mahmoud and Ehab to calculate the minimum value of this function over all valid $j$ . They found it a bit easy, so Dr. Evil made their task harder. He will give them $q$ update queries. During each update they should add an integer $x_{i}$ to all elements in $a$ in range $[l_{i};r_{i}]$ i.e. they should add $x_{i}$ to $a_{li},a_{li}+1,...\ ,a_{ri}$ and then they should calculate the minimum value of $f(j)$ for all valid $j$ .
Please help Mahmoud and Ehab.
输入格式
The first line contains three integers $n,m$ and $q$ ( $1<=n<=m<=10^{5}$ , $1<=q<=10^{5}$ ) — number of elements in $a$ , number of elements in $b$ and number of queries, respectively.
The second line contains $n$ integers $a_{1},a_{2},...,a_{n}$ . ( $-10^{9}<=a_{i}<=10^{9}$ ) — elements of $a$ .
The third line contains $m$ integers $b_{1},b_{2},...,b_{m}$ . ( $-10^{9}<=b_{i}<=10^{9}$ ) — elements of $b$ .
Then $q$ lines follow describing the queries. Each of them contains three integers $l_{i}$ $r_{i}$ $x_{i}$ ( $1<=l_{i}<=r_{i}<=n$ , $-10^{9}<=x<=10^{9}$ ) — range to be updated and added value.
The second line contains $n$ integers $a_{1},a_{2},...,a_{n}$ . ( $-10^{9}<=a_{i}<=10^{9}$ ) — elements of $a$ .
The third line contains $m$ integers $b_{1},b_{2},...,b_{m}$ . ( $-10^{9}<=b_{i}<=10^{9}$ ) — elements of $b$ .
Then $q$ lines follow describing the queries. Each of them contains three integers $l_{i}$ $r_{i}$ $x_{i}$ ( $1<=l_{i}<=r_{i}<=n$ , $-10^{9}<=x<=10^{9}$ ) — range to be updated and added value.
输出格式
The first line should contain the minimum value of the function $f$ before any update.
Then output $q$ lines, the $i$ -th of them should contain the minimum value of the function $f$ after performing the $i$ -th update .
Then output $q$ lines, the $i$ -th of them should contain the minimum value of the function $f$ after performing the $i$ -th update .
输入输出样例
输入 #1
5 6 3 1 2 3 4 5 1 2 3 4 5 6 1 1 10 1 1 -9 1 5 -1
输出 #1
0 9 0 0
For the first example before any updates it's optimal to choose $j=0$ , $f(0)=|(1-1)-(2-2)+(3-3)-(4-4)+(5-5)|=|0|=0$ .
After the first update $a$ becomes ${11,2,3,4,5}$ and it's optimal to choose $j=1$ , $f(1)=|(11-2)-(2-3)+(3-4)-(4-5)+(5-6)=|9|=9$ .
After the second update $a$ becomes ${2,2,3,4,5}$ and it's optimal to choose $j=1$ , $f(1)=|(2-2)-(2-3)+(3-4)-(4-5)+(5-6)|=|0|=0$ .
After the third update $a$ becomes ${1,1,2,3,4}$ and it's optimal to choose $j=0$ , $f(0)=|(1-1)-(1-2)+(2-3)-(3-4)+(4-5)|=|0|=0$ .
After the first update $a$ becomes ${11,2,3,4,5}$ and it's optimal to choose $j=1$ , $f(1)=|(11-2)-(2-3)+(3-4)-(4-5)+(5-6)=|9|=9$ .
After the second update $a$ becomes ${2,2,3,4,5}$ and it's optimal to choose $j=1$ , $f(1)=|(2-2)-(2-3)+(3-4)-(4-5)+(5-6)|=|0|=0$ .
After the third update $a$ becomes ${1,1,2,3,4}$ and it's optimal to choose $j=0$ , $f(0)=|(1-1)-(1-2)+(2-3)-(3-4)+(4-5)|=|0|=0$ .
C++ 编辑器
输入
输出
可保存默认模板;新题优先使用已保存模板。
当前快捷键仅展示,暂不支持修改。
- 撤销
Ctrl / ⌘ + Z - 重做
Ctrl / ⌘ + Y - 查找
Ctrl / ⌘ + F - 全选
Ctrl / ⌘ + A - 复制
Ctrl / ⌘ + C - 剪切
Ctrl / ⌘ + X - 粘贴
Ctrl / ⌘ + V - 自动排版
工具栏排版按钮 - 草稿保存
编辑时自动保存到本机
历史
提交记录
状态说明时间源码
AI
作答助手
你好,我是作答助手。可以问思路、复杂度、样例含义或代码报错原因;不会直接给出完整 AC 代码。
确定要清空代码吗?
提交通过
评测结果:Accepted