DESCRIPTION : BIN to seven segments converter
-- segment encoding
-- a
-- +---+
-- f | | b
-- +---+ <- g
-- e | | c
-- +---+
-- d
-- Enable (EN) active : high
-- Outputs (data_out) active : low
Problem B:Longest Ordered Subsequence
A numeric sequence of ai is ordered if a1 < a2 < ... < aN. Let the subsequence of the given numeric sequence (a1, a2, ..., aN) be any sequence (ai1, ai2, ..., aiK), where 1 <= i1 < i2 < ... < iK <= N. For example, sequence (1, 7, 3, 5, 9, 4, 8) has ordered subsequences, e. g., (1, 7), (3, 4, 8) and many others. All longest ordered subsequences are of length 4, e. g., (1, 3, 5, 8).
basic.c */
/**//* Project:NeuroBasic, basic package*//**/
/* Survey:This is a simple Basic b-code compiler which*/
/*can be used as a comfortable command shell for */
/* any program. The actual compiler is found in */
/*compiler.c.*/
/*The functions m_fctptr() and user_server()*/
/*build an interface to an
給定兩個(gè)集合A、B,集合內(nèi)的任一元素x滿足1 ≤ x ≤ 109,并且每個(gè)集合的元素個(gè)數(shù)不大于105。我們希望求出A、B之間的關(guān)系。
任 務(wù) :給定兩個(gè)集合的描述,判斷它們滿足下列關(guān)系的哪一種:
A是B的一個(gè)真子集,輸出“A is a proper subset of B”
B是A的一個(gè)真子集,輸出“B is a proper subset of A”
A和B是同一個(gè)集合,輸出“A equals B”
A和B的交集為空,輸出“A and B are disjoint”
上述情況都不是,輸出“I m confused!”
I. C. Wong, Z. Shen, J. G. Andrews, and B. L. Evans, ``A Low Complexity Algorithm for Proportional Resource Allocation in OFDMA Systems , Proc. IEEE Int. Work. Signal Processing Systems, 針對這篇文章給出的源代碼