分析了小型燃料电池的详细说明

VC++MFC编程实例之八-VC MFC programming examples 8

MFC深入浅出[完整版][李永进] 对MFC做了详细的说明-MFC simple [integrity] [-jin] MFC done a detailed description

主要讲述ARM的软硬件开发，以及关于PDA的系统设计，和Linux程序设计-ARM focuses on software and hardware development, as well as on the PDA-system design, and Linux Programming

希望大家喜欢，这是我自己写的程序，请多多指教-like

蓝牙无线通讯协议-Bluetooth wireless communication protocol

Data+Structures+Algorithms+in+Java,讲术java的数据结构和算法-Data Structures in Java, java stresses in the data structure and algorithm

很多人躲在寻找的实战_ejb cool！-find many people hide the real _ejb cool!

孙鑫VC深入分析视频的PPt，对初学者很有用，看看帮助很大的-Sun Xin VC-depth analysis of video PPt, useful for beginners to see to help much. . . .

某石油公司计划建造一条由东向西的主输油管道。该管道要穿过一个有 n 口油井的油田。从每口油井都要有一条输油管道沿最短路经(或南或北)与主管道相连。如果给定 n口油井的位置,即它们的 x 坐标（东西向）和 y 坐标（南北向）,应如何确定主管道的最优位置,即使各油井到主管道之间的输油管道长度总和最小的位置?证明可在线性时间内确定主管道的最优位置,使得给定n口油井的位置,编程计算各油井到主管道之间的输油管道最小长度总和。 -An oil company plans to construct a east to west from the main pipeline. The pipeline to pass through an oil field n wells. Wells from each must have a pipeline along the shortest path (or South or North) connected with the competent Road. If given the location of oil wells in n, that is, their x coordinates (east-west) and y coordinates (north-south), should be how to determine the optimal position in charge of Road, even if the wells to the pipeline in charge of Road between the sum of the smallest length location? proved to be linear time in charge of Road to determine the optimal location, making a given n the location of oil wells, programmed to calculate the well-to-charge of Road between the length of the sum of the smallest oil pipeline.

C++ Templates for use template -C++ Templates for use template