uva1442
2015-03-20 17:59
211 查看
#include<cstdio> #include<algorithm> #define maxn 1000000+10 using namespace std; int s[maxn],p[maxn],h1[maxn],h2[maxn],n; int solve() { int cnt=0,tmp1=s[n-1],tmp2=s[0]; for(int i=n-1; i>=0; i--) { if(tmp1<p[i])tmp1=p[i]; if(tmp1>s[i])tmp1=s[i]; h1[i]=tmp1; } for(int i=0; i<n; i++) { if(tmp2<p[i])tmp2=p[i]; if(tmp2>s[i])tmp2=s[i]; h2[i]=tmp2; } for(int i=0; i<n; i++) { h1[i]=min(h1[i],h2[i]); cnt+=h1[i]-p[i]; } return cnt; } int main() { int T; scanf("%d",&T); while(T--) { scanf("%d",&n); for(int i=0; i<n; i++) scanf("%d",&p[i]); for(int i=0; i<n; i++) scanf("%d",&s[i]); printf("%d\n",solve()); } return 0; }
左右各扫一遍,求出满足条件的h
相关文章推荐
- 例题8-18 洞穴(Cave, ACM/ICPC CERC 2009, UVa1442)
- Cav UVA - 1442
- uva 1442:Cave(贪心)
- UVA 1442(p249)----Cave
- 神奇的题(存石油的洞穴,uva 1442)
- UVA 1442 Cave 洞穴 (贪心+扫描)
- UVA1442_Cave
- uva - 1442(cav 递推类 ,思路)
- Uva 1442 扫描法
- uva 1442 - Cav(贪心)
- UVA - 1442 Cav
- UVa 1442:Cav(杂题)
- uva1442 cave
- Cav UVA - 1442
- 【高效算法设计——双向扫描】 UVa 1442 Cave
- UVa 1442 (线性扫描) Cave
- uva 1442 Cav(左右各扫描一次)
- UVA-1442 Cav
- UVA1442 Cave
- UVA 106 Fermat vs. Pythagoras