XA科研 - 博客园

2021年2月23日

1090 Highest Price in Supply Chain (25 分)

摘要： A supply chain is a network of retailers（零售商）, distributors（经销商）, and suppliers（供应商）-- everyone involved in moving a product from supplier to customer 阅读全文

posted @ 2021-02-23 22:41 XA科研阅读(46) 评论(0) 推荐(0) 编辑

树的遍历

摘要：一：由先序和中序，确定后序 post(0,0,n-1); void toPost(int root,int left,int right){//root为先序中根节点的下标，left和right分别为中序中子树的左右边界 if(left>right){ return ; } int i=left; 阅读全文

posted @ 2021-02-23 20:49 XA科研阅读(47) 评论(0) 推荐(0) 编辑

1086 Tree Traversals Again (25 分)

摘要： An inorder binary tree traversal can be implemented in a non-recursive way with a stack. For example, suppose that when a 6-node binary tree (with the 阅读全文

posted @ 2021-02-23 00:32 XA科研阅读(56) 评论(0) 推荐(0) 编辑

2021年2月22日

1079 Total Sales of Supply Chain (25 分树

摘要： A supply chain is a network of retailers（零售商）, distributors（经销商）, and suppliers（供应商）-- everyone involved in moving a product from supplier to customer 阅读全文

posted @ 2021-02-22 23:27 XA科研阅读(58) 评论(0) 推荐(0) 编辑

1053 Path of Equal Weight (30 分)

摘要： Given a non-empty tree with root R, and with weight Wi assigned to each tree node Ti. The weight of a path from R to L is defined to be the sum 阅读全文

posted @ 2021-02-22 21:46 XA科研阅读(67) 评论(0) 推荐(0) 编辑

1076 Forwards on Weibo (30 分)

摘要： Weibo is known as the Chinese version of Twitter. One user on Weibo may have many followers, and may follow many other users as well. Hence a social n 阅读全文

posted @ 2021-02-22 21:44 XA科研阅读(54) 评论(0) 推荐(0) 编辑

1072 Gas Station (30 分)

摘要： A gas station has to be built at such a location that the minimum distance between the station and any of the residential housing is as far away as po 阅读全文

posted @ 2021-02-22 00:04 XA科研阅读(49) 评论(0) 推荐(0) 编辑

2021年2月21日

1142 Maximal Clique (25 分) 图论

摘要： A clique is a subset of vertices of an undirected graph such that every two distinct vertices in the clique are adjacent. A maximal clique is a clique 阅读全文

posted @ 2021-02-21 22:26 XA科研阅读(92) 评论(0) 推荐(0) 编辑

1150 Travelling Salesman Problem (25）图

摘要： The "travelling salesman problem" asks the following question: "Given a list of cities and the distances between each pair of cities, what is the shor 阅读全文

posted @ 2021-02-21 21:41 XA科研阅读(71) 评论(0) 推荐(0) 编辑

STL易错点总结（一）

摘要： 1.cin和cout消耗的时间比scanf和printf多得多，建议用后者 2.memset不能对数组进行任意初始化，只能初始化为-1，0 3.初始化一般用fill 一维数组：fill (array,array+4,5); vector容器：fill (myvector.begin(),myvect 阅读全文

posted @ 2021-02-21 20:54 XA科研阅读(103) 评论(0) 推荐(0) 编辑

强风吹拂

公告