摘要： 1007. Maximum Subsequence Sum (25)时间限制400 ms内存限制32000 kB代码长度限制16000 B判题程序Standard作者CHEN, YueGiven a sequence of K integers { N1, N2, ..., NK}. A continuous subsequence is defined to be { Ni, Ni+1, ..., Nj} where 1 <= i <= j <= K. TheMaximum Subsequenceis the continuous subsequence which has 阅读全文

摘要： 1004. Counting Leaves (30)时间限制400 ms内存限制32000 kB代码长度限制16000 B判题程序Standard作者CHEN, YueA family hierarchy is usually presented by a pedigree tree. Your job is to count those family members who have no child.InputEach input file contains one test case. Each case starts with a line containing 0 < N &l 阅读全文

摘要： 1022. Digital Library (30)时间限制1000 ms内存限制32000 kB代码长度限制16000 B判题程序Standard作者CHEN, YueA Digital Library contains millions of books, stored according to their titles, authors, key words of their abstracts, publishers, and published years. Each book is assigned an unique 7-digit number as its ID. Given 阅读全文

摘要： 1012. The Best Rank (25)时间限制400 ms内存限制32000 kB代码长度限制16000 B判题程序Standard作者CHEN, YueTo evaluate the performance of our first year CS majored students, we consider their grades of three courses only: C - C Programming Language, M - Mathematics (Calculus or Linear Algrbra), and E - English. At the mean 阅读全文

摘要： I begin to play with arduino, which can be developped with arduino c (itresembles c or cpp).my first program is to drive the 7-segment led.it is simpler than verilog HDL because it is not the sucky ha... 阅读全文

摘要： Insertion sort, buble sort, selection sort, shell sort, quick sort, heap sort, merge sort, radix sort......Sort seems like a simple problem but fascinating.[代码] 阅读全文

摘要： Heap seems sophisticated but the implementation is not very difficult. i think it is attrtibuted to its linear structure~Besides, heap is very useful~[代码] 阅读全文

摘要： i implement the preorder , inorder ,postorder traversal in recursive way and iterative way , print tree , delete node , insert node.... with cpp..[代码] 阅读全文

摘要： Iread about an intresting problem yesterday: how to convert an arabic to Chinese number? It looks simple but actually very complicated and it dose cost me several hours to solve. Code is not commented... 阅读全文

摘要： The first homework of db design is to compare the speed of accessing cache , meory and disk. This experiment show the gap among them.To test the accecc time of cache , I use cpu-z to find that the blo... 阅读全文