|
|
< ><FONT color=#1b414b>哪位高手帮帮忙做一下这道题，在这里先谢谢了！</FONT></P>
< ><FONT color=#1b414b></FONT> </P>
< ><FONT color=#1b414b>算法分析与设计第三章（清华大学出版社）</FONT></P>
<P ><FONT color=#1b414b>划分问题：（用动态规划）</FONT></P>
<P ><FONT color=#1b414b>现提供已经几组数据：</FONT></P>
<P ><FONT face="Times New Roman"><FONT color=#1b414b> <p></p></FONT></FONT></P>
<P ><FONT color=#1b414b><FONT face="Times New Roman">30</FONT>个元素</FONT></P>
<P ><FONT face="Times New Roman"><FONT color=#1b414b>a[]={21,5,38,11,10,17,15,27,25,42,22,8,26,13,16,37,1,24,31,19,2,14,28,3,33,23,43,20,12,14};<p></p></FONT></FONT></P>
<P ><FONT color=#1b414b>要求：</FONT></P>
<P ><FONT color=#1b414b>输入：<FONT face="Times New Roman">A={a<SUB>1</SUB>,a<SUB>2</SUB>,…,a<SUB>n</SUB>},</FONT>其中<FONT face="Times New Roman">a<SUB>i</SUB></FONT>∈<FONT face="Times New Roman">Z+(1</FONT>≤i≤<FONT face="Times New Roman">n)</FONT></FONT></P>
<P ><FONT color=#1b414b>输出：是否存在<FONT face="Times New Roman">P</FONT>属于<FONT face="Times New Roman">A,</FONT>使∑a<SUB>i</SUB>=∑a<SUB>j </SUB>(a<SUB>i</SUB>∈P,a<SUB>j</SUB>∈A-P)<p></p></FONT></P>
<P ><FONT color=#1b414b>要求用C语言做（最好有编程思路）</FONT></P>
<P ><FONT color=#1b414b></FONT> </P>
<P ><FONT color=#1b414b></FONT> </P>
<P ><FONT color=#1b414b></FONT> </P> |
|
发表于 2005-12-12 17:05:47