uva 11078 Open Credit System
2014-04-30 16:36
435 查看
求0到n的数,求ai - aj的最大值,维护aj之前的最大值即可,用max - aj.
#include <cstdlib> #include <iostream> #include <stdio.h> #include <algorithm> using namespace std; const int MAX = 100000+5; int a[MAX]; int main(int argc, char *argv[]) { int t,n; scanf("%d",&t); while(t--) { scanf("%d",&n); for(int i = 0; i < n; i++) { scanf("%d",a+i); } int m = a[0],ans = a[0] - a[1]; for(int i = 1; i < n; i++) { ans = max(m - a[i],ans); m = max(m,a[i]); } printf("%d\n",ans); } //system("PAUSE"); return EXIT_SUCCESS; }
相关文章推荐
- UVa 11078 - Open Credit System(开放式学分制)
- UVA 11078 Open Credit System .
- UVa 11078 Open Credit System (序列前后最大差)
- UVA 11078(p41)----Open Credit System
- 指南第一章 例题18 UVA 11078 Open Credit System(扫描,维护最大值)
- UVa11078 - Open Credit System
- uva 11078 - Open Credit System
- uva11078 Open Credit System
- UVA - 11078 Open Credit System 推理
- 【UVA 11078】BUPT 2015 newbie practice #2 div2-A -Open Credit System
- UVA 11078 - Open Credit System
- UVA 11078 Open Credit System(扫描 维护最大值)
- UVa 11078 - Open Credit System
- Open Credit System UVa 11078
- Open Credit System UVA - 11078
- uva 11078 - Open Credit System(水题)
- UVA 11078 Open Credit System(空间优化+时间优化)
- Open Credit System(UVA11078)
- UVA 11078 - Open Credit System
- UVa 11078 Open Credit System