UVa OJ 1442 - Cav
2016-09-20 20:57
176 查看
UVa OJ 1442 - Cav
Problem
Link: 1442 - CavSolution
Use greedy algorithm to deal with this problem.Adjust the height of ceiling to fit the requirements.
Here is the code:
#include <iostream> #include <cstdio> using namespace std; const int maxn = 1e6+5; int cas, n, cnt; int ceiling[maxn], floor[maxn]; int main() { ios::sync_with_stdio(false); cin.tie(0); //freopen("input.txt" , "r", stdin ); //freopen("output.txt", "w", stdout); cin >> cas; while(cas--) { cnt = 0; cin >> n; for (int i = 0; i < n; ++i) cin >> floor[i]; for (int i = 0; i < n; ++i) cin >> ceiling[i]; int tmp = maxn; for (int i = 0; i < n; ++i) { tmp = min(tmp, ceiling[i]); tmp = max(tmp, floor[i]); ceiling[i] = tmp; } tmp = maxn; for (int i = n-1; i > -1; --i) { tmp = min(tmp, ceiling[i]); tmp = max(tmp, floor[i]); ceiling[i] = tmp; cnt += ceiling[i] - floor[i]; } cout << cnt << '\n'; } return 0; }
相关文章推荐
- 1442 - Cav(扫描+推理)
- uva 1442 - Cav(贪心)
- Cav UVA - 1442
- UVA-1442 Cav
- 1442 - Cav
- UVa 1442:Cav(杂题)
- 1442 - Cav
- Cav UVA - 1442
- uva - 1442(cav 递推类 ,思路)
- uva 1442 Cav(左右各扫描一次)
- UVA - 1442 Cav
- uva oj 10905 解题报告
- UVa OJ 128 - Software CRC (软件CRC)
- UVa OJ 299-Train Swapping
- UVa OJ 11636-Hello World!
- uva oj 458
- POJ 1442 Black Box (堆 || 线段树 || SBT || Splay)
- Cav
- Uva Oj 10000 - Longest Paths
- poj 1442(堆---优先队列)