紫书 第五章 例题
Chen丶HC
这个作者很懒,什么都没留下…
展开
-
5 - 12
//例题5-12 UVa221 Urban Elevations//1. ordered south-to-north, west-to-east.int graph[10005][10005];struct building { int x, y, w, d, h;}b[1005];bool cmp(const int &n, const int &m) { if (b[n].x原创 2017-06-29 20:46:28 · 357 阅读 · 0 评论 -
第五章 总结
//检索int main() { int a[] = { 10, 20, 30, 40 }; auto p1 = find(a, a + 4, 10); auto p2 = find(a, a + 4, 0); auto p3 = lower_bound(a, a + 4, 15);//return >= val auto p4 = upper_bound(a, a + 4, 15);原创 2017-07-04 15:18:15 · 204 阅读 · 0 评论 -
5-1 ~ 5-11
//5-1 UVa 10474 /* int Marble[10005]; int T, Q; void Judge(int q) { int i; for(i = 1; i <= T; i++) { if(Marble[i] == q) break; } if(i != T+1) printf("%d原创 2017-06-23 16:25:59 · 403 阅读 · 0 评论