搜索资源列表
maxm
- 给定由n 个整数(可能为负整数)组成的序列1 a ， 2 a ，…， n a ，以及一个正整数m，要 求确定序列1 a ， 2 a ，…， n a 的m 个不相交子段，使这m 个子段的总和达到最大。-given by n integers (with the possible negative integers) consisting of a sequence of 1, a 2, ..., n a, and a positive integer m, a request to deter
The-traffic-light
- 基于51单片机的模拟交通灯程序，实现十字路口通车规则-Based on 51 single chip microcomputer simulation of traffic light procedures, the realization of the intersection traffic rules
JTD_F
- 基于FPGA的VHDL路口智能交通的设计-FPGA-based VHDL design intelligent transportation intersection
ArxBreakSs
- 这个是用VC+ObjectARX开发的AutoCad中的曲线选择集交点打断源码-This is the intersection of selection set interrupted by VC+ ObjectARX development AutoCad curve Source.
两个有序链表的交集
- 求两个有序链表的交集，并在另一行显示出来。(Find the intersection of two ordered lists, and show them on another line.)
opencv_Image
- 很大很全的图像处理算法，包括二值化、图像细化、直线检测、直线交点识别等(Large and very full image processing algorithms, including two values, image thinning, straight line detection, line intersection recognition, etc.)