A8174 | Linear Kingdom Races
时间限制1s
内存限制256MB
通过 / 提交0/0
题目描述
You are a car race organizer and would like to arrange some races in Linear Kingdom.
Linear Kingdom has $n$ consecutive roads spanning from left to right. The roads are numbered from $1$ to $n$ from left to right, thus the roads follow in the order of their numbers' increasing. There will be several races that may be held on these roads. Each race will use a consecutive subset of these roads. Also, each race will pay some amount of money to you if this race is held. No races overlap in time, so some roads can be used in several races.
Unfortunately, some of the roads are in a bad condition and they need repair. Each road has repair costs associated with it, you are required to pay this cost to repair the road. A race can only take place if all the roads used in the race are renovated. Your task is to repair such roads (possibly all or none) that will maximize your profit. Your profit is defined as the total money you get from the races that are held minus the total money you spent to repair the roads. Note that you may decide not to repair any road and gain zero profit.
Print the maximum profit you can gain.
Linear Kingdom has $n$ consecutive roads spanning from left to right. The roads are numbered from $1$ to $n$ from left to right, thus the roads follow in the order of their numbers' increasing. There will be several races that may be held on these roads. Each race will use a consecutive subset of these roads. Also, each race will pay some amount of money to you if this race is held. No races overlap in time, so some roads can be used in several races.
Unfortunately, some of the roads are in a bad condition and they need repair. Each road has repair costs associated with it, you are required to pay this cost to repair the road. A race can only take place if all the roads used in the race are renovated. Your task is to repair such roads (possibly all or none) that will maximize your profit. Your profit is defined as the total money you get from the races that are held minus the total money you spent to repair the roads. Note that you may decide not to repair any road and gain zero profit.
Print the maximum profit you can gain.
输入格式
The first line contains two single-space separated integers, $n$ and $m$ ( $1<=n,m<=2·10^{5}$ ), denoting the number of roads and the number of races, respectively.
Then $n$ lines follow, each line will contain a single non-negative integer not exceeding $10^{9}$ denoting the cost to repair a road. The costs are given in order from road $1$ to road $n$ .
Finally, $m$ lines follow. Each line is single-space-separated triplets of integers. Each triplet will be given as $lb$ , $ub$ , and $p$ ( $1<=lb<=ub<=n,1<=p<=10^{9}$ ), which means that the race these three integers describe will use all the roads from $lb$ to $ub$ , inclusive, and if it's held you get $p$ .
Then $n$ lines follow, each line will contain a single non-negative integer not exceeding $10^{9}$ denoting the cost to repair a road. The costs are given in order from road $1$ to road $n$ .
Finally, $m$ lines follow. Each line is single-space-separated triplets of integers. Each triplet will be given as $lb$ , $ub$ , and $p$ ( $1<=lb<=ub<=n,1<=p<=10^{9}$ ), which means that the race these three integers describe will use all the roads from $lb$ to $ub$ , inclusive, and if it's held you get $p$ .
输出格式
Print a single integer denoting the maximum possible profit you can gain.
Please, do not use the %lld specificator to read or write 64-bit integers in C++. It is recommended to use cin, cout stream (also you may use %I64d specificator).
Please, do not use the %lld specificator to read or write 64-bit integers in C++. It is recommended to use cin, cout stream (also you may use %I64d specificator).
输入输出样例
输入 #1
7 4 3 2 3 2 1 2 3 1 2 5 2 3 5 3 5 3 7 7 5
输出 #1
4
输入 #2
2 1 0 3 1 2 5
输出 #2
2
输入 #3
3 1 10 10 10 1 3 10
输出 #3
0
In the first sample the optimal solution is to repair roads $1$ , $2$ , $3$ , and $7$ . Three races will take place which nets you $15$ . The road repair costs $11$ , hence your profit is $4$ .
C++ 编辑器
输入
输出
可保存默认模板;新题优先使用已保存模板。
当前快捷键仅展示,暂不支持修改。
- 撤销
Ctrl / ⌘ + Z - 重做
Ctrl / ⌘ + Y - 查找
Ctrl / ⌘ + F - 全选
Ctrl / ⌘ + A - 复制
Ctrl / ⌘ + C - 剪切
Ctrl / ⌘ + X - 粘贴
Ctrl / ⌘ + V - 自动排版
工具栏排版按钮 - 草稿保存
编辑时自动保存到本机
历史
提交记录
状态说明时间源码
AI
作答助手
你好,我是作答助手。可以问思路、复杂度、样例含义或代码报错原因;不会直接给出完整 AC 代码。
确定要清空代码吗?
提交通过
评测结果:Accepted