﻿<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:trackback="http://madskills.com/public/xml/rss/module/trackback/" xmlns:wfw="http://wellformedweb.org/CommentAPI/" xmlns:slash="http://purl.org/rss/1.0/modules/slash/"><channel><title>C++博客-碧海蓝天</title><link>http://www.cppblog.com/meizixiong/</link><description /><language>zh-cn</language><lastBuildDate>Thu, 09 Apr 2026 07:08:19 GMT</lastBuildDate><pubDate>Thu, 09 Apr 2026 07:08:19 GMT</pubDate><ttl>60</ttl><item><title>java继承</title><link>http://www.cppblog.com/meizixiong/archive/2011/11/29/161175.html</link><dc:creator>碧云天</dc:creator><author>碧云天</author><pubDate>Tue, 29 Nov 2011 09:11:00 GMT</pubDate><guid>http://www.cppblog.com/meizixiong/archive/2011/11/29/161175.html</guid><wfw:comment>http://www.cppblog.com/meizixiong/comments/161175.html</wfw:comment><comments>http://www.cppblog.com/meizixiong/archive/2011/11/29/161175.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/meizixiong/comments/commentRss/161175.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/meizixiong/services/trackbacks/161175.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; &nbsp; <span style="font-size: 12pt; font-family: Arial;">java 重载，是指在一个类中有多个函数名相同，但参数的个数或顺序不同的方法。</span><br /><span style="font-size: 12pt; font-family: Arial;">&nbsp;&nbsp;&nbsp;&nbsp; &nbsp;&nbsp; java 覆盖，即指override函数，它始终只有一种含义，只不过旧的含义完全被旧的含义取代了。只有发生了覆盖，才能实现程序的多态性</span><span style="font-size: 12pt; font-family: Arial;">。</span><br /><span style="font-size: 12pt; font-family: Arial;">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 抽象方法：只有方法声明，没有方法主体的方法。它主要是用来让不同的子类作出不同的表示。</span><br /><span style="font-size: 12pt; font-family: Arial;">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 抽象类：含有抽象方法的类称为抽象类。用abstract关键字来标识，即使类没有抽象方法，也可用此关键字来标识，这样就可以避免客户端生成此类的实例。</span><br /><span style="font-size: 12pt; font-family: Arial;">&nbsp;&nbsp;&nbsp; &nbsp;&nbsp; 接口，可以理解为纯抽象类。可包含基本的数据成员，默认为final和static。接口的一个重要用途就是用来实现多继承，另外一个作用与抽象类一样，就是防止客户程序员将此类实例化。如果我们要实现的基类没有任何方法定义或成员变量，则优先使用接口。</span><br /><img src ="http://www.cppblog.com/meizixiong/aggbug/161175.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/meizixiong/" target="_blank">碧云天</a> 2011-11-29 17:11 <a href="http://www.cppblog.com/meizixiong/archive/2011/11/29/161175.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title> Longest  Prefix——usaco心得</title><link>http://www.cppblog.com/meizixiong/archive/2010/03/04/108900.html</link><dc:creator>碧云天</dc:creator><author>碧云天</author><pubDate>Thu, 04 Mar 2010 13:24:00 GMT</pubDate><guid>http://www.cppblog.com/meizixiong/archive/2010/03/04/108900.html</guid><wfw:comment>http://www.cppblog.com/meizixiong/comments/108900.html</wfw:comment><comments>http://www.cppblog.com/meizixiong/archive/2010/03/04/108900.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/meizixiong/comments/commentRss/108900.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/meizixiong/services/trackbacks/108900.html</trackback:ping><description><![CDATA[这是一个一维的DP算法题。<br>
<div style="border: 1px solid #cccccc; padding: 4px 5px 4px 4px; background-color: #eeeeee; font-size: 13px; width: 98%;"><!--<br><br>Code highlighting produced by Actipro CodeHighlighter (freeware)<br>http://www.CodeHighlighter.com/<br><br>--><span style="color: #008080;">&nbsp;1</span>&nbsp;<span style="color: #000000;">#include&nbsp;</span><span style="color: #000000;">&lt;</span><span style="color: #000000;">iostream</span><span style="color: #000000;">&gt;</span><span style="color: #000000;"><br></span><span style="color: #008080;">&nbsp;2</span>&nbsp;<span style="color: #000000;">#include&nbsp;</span><span style="color: #000000;">&lt;</span><span style="color: #000000;">fstream</span><span style="color: #000000;">&gt;</span><span style="color: #000000;"><br></span><span style="color: #008080;">&nbsp;3</span>&nbsp;<span style="color: #000000;">#include&nbsp;</span><span style="color: #000000;">&lt;</span><span style="color: #0000ff;">string</span><span style="color: #000000;">&gt;</span><span style="color: #000000;"><br></span><span style="color: #008080;">&nbsp;4</span>&nbsp;<span style="color: #000000;">#include&nbsp;</span><span style="color: #000000;">&lt;</span><span style="color: #0000ff;">string</span><span style="color: #000000;">.h</span><span style="color: #000000;">&gt;</span><span style="color: #000000;"><br></span><span style="color: #008080;">&nbsp;5</span>&nbsp;<span style="color: #000000;"></span><span style="color: #0000ff;">using</span><span style="color: #000000;">&nbsp;</span><span style="color: #0000ff;">namespace</span><span style="color: #000000;">&nbsp;std;<br></span><span style="color: #008080;">&nbsp;6</span>&nbsp;<span style="color: #000000;"></span><span style="color: #008000;">//</span><span style="color: #008000;">#define&nbsp;MaxMap&nbsp;200<br></span><span style="color: #008080;">&nbsp;7</span>&nbsp;<span style="color: #008000;"></span><span style="color: #008000;">//</span><span style="color: #008000;">#define&nbsp;&nbsp;MaxLen&nbsp;10</span><span style="color: #008000;"><br></span><span style="color: #008080;">&nbsp;8</span>&nbsp;<span style="color: #008000;"></span><span style="color: #000000;">ofstream&nbsp;fout&nbsp;(</span><span style="color: #000000;">"</span><span style="color: #000000;">prefix.out</span><span style="color: #000000;">"</span><span style="color: #000000;">);<br></span><span style="color: #008080;">&nbsp;9</span>&nbsp;<span style="color: #000000;">ifstream&nbsp;fin&nbsp;(</span><span style="color: #000000;">"</span><span style="color: #000000;">prefix.in</span><span style="color: #000000;">"</span><span style="color: #000000;">);<br></span><span style="color: #008080;">10</span>&nbsp;<span style="color: #000000;"></span><span style="color: #008000;">//</span><span style="color: #008000;">vector&lt;string&gt;&nbsp;vec;<br></span><span style="color: #008080;">11</span>&nbsp;<span style="color: #008000;"></span><span style="color: #008000;">//</span><span style="color: #008000;"><br></span><span style="color: #008080;">12</span>&nbsp;<span style="color: #008000;"></span><span style="color: #008000;">//</span><span style="color: #008000;">char&nbsp;prefix[MaxMap+1][MaxLen+];<br></span><span style="color: #008080;">13</span>&nbsp;<span style="color: #008000;"></span><span style="color: #008000;">//</span><span style="color: #008000;">int&nbsp;nump;</span><span style="color: #008000;"><br></span><span style="color: #008080;">14</span>&nbsp;<span style="color: #008000;"></span><span style="color: #0000ff;">string</span><span style="color: #000000;">&nbsp;str</span><span style="color: #000000;">=</span><span style="color: #000000;">""</span><span style="color: #000000;">;<br></span><span style="color: #008080;">15</span>&nbsp;<span style="color: #000000;"></span><span style="color: #0000ff;">char</span><span style="color: #000000;">&nbsp;prim[</span><span style="color: #000000;">11</span><span style="color: #000000;">][</span><span style="color: #000000;">201</span><span style="color: #000000;">][</span><span style="color: #000000;">11</span><span style="color: #000000;">];//一个char类型的三维数组，方便按串的长度索引字典<br></span><span style="color: #008080;">16</span>&nbsp;<span style="color: #000000;"></span><span style="color: #0000ff;">int</span><span style="color: #000000;">&nbsp;MAX_len</span><span style="color: #000000;">=</span><span style="color: #000000;">0</span><span style="color: #000000;">;<br></span><span style="color: #008080;">17</span>&nbsp;<span style="color: #000000;"></span><span style="color: #0000ff;">int</span><span style="color: #000000;">&nbsp;len_s</span><span style="color: #000000;">=</span><span style="color: #000000;">0</span><span style="color: #000000;">;<br></span><span style="color: #008080;">18</span>&nbsp;<span style="color: #000000;"></span><span style="color: #0000ff;">int</span><span style="color: #000000;">&nbsp;re[</span><span style="color: #000000;">200001</span><span style="color: #000000;">]</span><span style="color: #000000;">=</span><span style="color: #000000;">{</span><span style="color: #000000;">0</span><span style="color: #000000;">};//一维的结果数组，在此一维数组中找最大（最优）的那个值，因此此题为一维DP算法题<br></span><span style="color: #008080;">19</span>&nbsp;<span style="color: #000000;"></span><span style="color: #0000ff;">int</span><span style="color: #000000;">&nbsp;Num_Prim[</span><span style="color: #000000;">11</span><span style="color: #000000;">]</span><span style="color: #000000;">=</span><span style="color: #000000;">{</span><span style="color: #000000;">0</span><span style="color: #000000;">};//一个一维int类型数组，来记录各长度的串的个数<br></span><span style="color: #008080;">20</span>&nbsp;<span style="color: #000000;"></span><span style="color: #008000;">//</span><span style="color: #008000;">long&nbsp;long&nbsp;len[200001];<br></span><span style="color: #008080;">21</span>&nbsp;<span style="color: #008000;"></span><span style="color: #008000;">//</span><span style="color: #008000;">#define&nbsp;&nbsp;MAX_LEN&nbsp;&nbsp;</span><span style="color: #008000;"><br></span><span style="color: #008080;">22</span>&nbsp;<span style="color: #008000;"></span><span style="color: #0000ff;">void</span><span style="color: #000000;">&nbsp;getInput();<br></span><span style="color: #008080;">23</span>&nbsp;<span style="color: #000000;"></span><span style="color: #0000ff;">int</span><span style="color: #000000;">&nbsp;calLen();<br></span><span style="color: #008080;">24</span>&nbsp;<span style="color: #000000;"></span><span style="color: #008000;">//</span><span style="color: #008000;">bool&nbsp;cmp(string&nbsp;s1,string&nbsp;s2)<br></span><span style="color: #008080;">25</span>&nbsp;<span style="color: #008000;"></span><span style="color: #008000;">//</span><span style="color: #008000;">{<br></span><span style="color: #008080;">26</span>&nbsp;<span style="color: #008000;"></span><span style="color: #008000;">//</span><span style="color: #008000;">&nbsp;&nbsp;&nbsp;&nbsp;int&nbsp;l1=s1.size();<br></span><span style="color: #008080;">27</span>&nbsp;<span style="color: #008000;"></span><span style="color: #008000;">//</span><span style="color: #008000;">&nbsp;&nbsp;&nbsp;&nbsp;int&nbsp;l2=s2.size();<br></span><span style="color: #008080;">28</span>&nbsp;<span style="color: #008000;"></span><span style="color: #008000;">//</span><span style="color: #008000;">&nbsp;&nbsp;&nbsp;&nbsp;return&nbsp;(l1&gt;l2?true:false)&nbsp;;<br></span><span style="color: #008080;">29</span>&nbsp;<span style="color: #008000;"></span><span style="color: #008000;">//</span><span style="color: #008000;">}</span><span style="color: #008000;"><br></span><span style="color: #008080;">30</span>&nbsp;<span style="color: #008000;"></span><span style="color: #0000ff;">int</span><span style="color: #000000;">&nbsp;main()&nbsp;{<br></span><span style="color: #008080;">31</span>&nbsp;<span style="color: #000000;">&nbsp;&nbsp;&nbsp;&nbsp;<br></span><span style="color: #008080;">32</span>&nbsp;<span style="color: #000000;">&nbsp;&nbsp;&nbsp;&nbsp;getInput();<br></span><span style="color: #008080;">33</span>&nbsp;<span style="color: #000000;">&nbsp;&nbsp;&nbsp;&nbsp;</span><span style="color: #008000;">//</span><span style="color: #008000;">sort(vec.begin(),vec.end(),cmp);</span><span style="color: #008000;"><br></span><span style="color: #008080;">34</span>&nbsp;<span style="color: #008000;"></span><span style="color: #000000;">&nbsp;&nbsp;&nbsp;&nbsp;<br></span><span style="color: #008080;">35</span>&nbsp;<span style="color: #000000;">&nbsp;&nbsp;&nbsp;&nbsp;fout&nbsp;</span><span style="color: #000000;">&lt;&lt;</span><span style="color: #000000;">&nbsp;calLen()</span><span style="color: #000000;">&lt;&lt;</span><span style="color: #000000;">endl;<br></span><span style="color: #008080;">36</span>&nbsp;<span style="color: #000000;">&nbsp;&nbsp;&nbsp;&nbsp;</span><span style="color: #0000ff;">return</span><span style="color: #000000;">&nbsp;</span><span style="color: #000000;">0</span><span style="color: #000000;">;<br></span><span style="color: #008080;">37</span>&nbsp;<span style="color: #000000;">}<br></span><span style="color: #008080;">38</span>&nbsp;<span style="color: #000000;"></span><span style="color: #0000ff;">bool</span><span style="color: #000000;">&nbsp;comp(</span><span style="color: #0000ff;">int</span><span style="color: #000000;">&nbsp;p,</span><span style="color: #0000ff;">int</span><span style="color: #000000;">&nbsp;num_prim,</span><span style="color: #0000ff;">int</span><span style="color: #000000;">&nbsp;l&nbsp;)</span><span style="color: #008000;">//</span><span style="color: #008000;">p代表str中字符的位置，k代表要匹配的字符串的长度,num_prim代表匹配字符串的索引</span><span style="color: #008000;"><br></span><span style="color: #008080;">39</span>&nbsp;<span style="color: #008000;"></span><span style="color: #000000;">{<br></span><span style="color: #008080;">40</span>&nbsp;<span style="color: #000000;">&nbsp;&nbsp;&nbsp;&nbsp;</span><span style="color: #0000ff;">for</span><span style="color: #000000;">(</span><span style="color: #0000ff;">int</span><span style="color: #000000;">&nbsp;i</span><span style="color: #000000;">=</span><span style="color: #000000;">0</span><span style="color: #000000;">;i</span><span style="color: #000000;">&lt;</span><span style="color: #000000;">l;i</span><span style="color: #000000;">++</span><span style="color: #000000;">)<br></span><span style="color: #008080;">41</span>&nbsp;<span style="color: #000000;">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</span><span style="color: #0000ff;">if</span><span style="color: #000000;">&nbsp;(str[p</span><span style="color: #000000;">-</span><span style="color: #000000;">1</span><span style="color: #000000;">-</span><span style="color: #000000;">i]</span><span style="color: #000000;">!=</span><span style="color: #000000;">prim[l][num_prim][l</span><span style="color: #000000;">-</span><span style="color: #000000;">1</span><span style="color: #000000;">-</span><span style="color: #000000;">i])<br></span><span style="color: #008080;">42</span>&nbsp;<span style="color: #000000;">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;{<br></span><span style="color: #008080;">43</span>&nbsp;<span style="color: #000000;">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</span><span style="color: #0000ff;">return</span><span style="color: #000000;">&nbsp;</span><span style="color: #0000ff;">false</span><span style="color: #000000;">;<br></span><span style="color: #008080;">44</span>&nbsp;<span style="color: #000000;">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;}<br></span><span style="color: #008080;">45</span>&nbsp;<span style="color: #000000;">&nbsp;&nbsp;&nbsp;&nbsp;</span><span style="color: #0000ff;">return</span><span style="color: #000000;">&nbsp;</span><span style="color: #0000ff;">true</span><span style="color: #000000;">;<br></span><span style="color: #008080;">46</span>&nbsp;<span style="color: #000000;">}<br></span><span style="color: #008080;">47</span>&nbsp;<span style="color: #000000;"></span><span style="color: #0000ff;">int</span><span style="color: #000000;">&nbsp;calLen()<br></span><span style="color: #008080;">48</span>&nbsp;<span style="color: #000000;">{<br></span><span style="color: #008080;">49</span>&nbsp;<span style="color: #000000;">&nbsp;<br></span><span style="color: #008080;">50</span>&nbsp;<span style="color: #000000;">&nbsp;&nbsp;&nbsp;&nbsp;</span><span style="color: #0000ff;">int</span><span style="color: #000000;">&nbsp;ans</span><span style="color: #000000;">=</span><span style="color: #000000;">0</span><span style="color: #000000;">;<br>&nbsp;&nbsp; //以下是三重循环，用来分别计算str中每一个字符所在的prefix长度<br></span><span style="color: #008080;">51</span>&nbsp;<span style="color: #000000;">&nbsp;&nbsp;&nbsp;&nbsp;</span><span style="color: #0000ff;">for</span><span style="color: #000000;">&nbsp;(</span><span style="color: #0000ff;">int</span><span style="color: #000000;">&nbsp;i</span><span style="color: #000000;">=</span><span style="color: #000000;">1</span><span style="color: #000000;">;i</span><span style="color: #000000;">&lt;=</span><span style="color: #000000;">len_s;i</span><span style="color: #000000;">++</span><span style="color: #000000;">)</span><span style="color: #008000;">//</span><span style="color: #008000;">字符串str从0开始</span><span style="color: #008000;"><br></span><span style="color: #008080;">52</span>&nbsp;<span style="color: #008000;"></span><span style="color: #000000;">&nbsp;&nbsp;&nbsp;&nbsp;{<br></span><span style="color: #008080;">53</span>&nbsp;<span style="color: #000000;">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</span><span style="color: #0000ff;">for</span><span style="color: #000000;">&nbsp;(</span><span style="color: #0000ff;">int</span><span style="color: #000000;">&nbsp;j</span><span style="color: #000000;">=</span><span style="color: #000000;">1</span><span style="color: #000000;">;j</span><span style="color: #000000;">&lt;=</span><span style="color: #000000;">MAX_len</span><span style="color: #000000;">&amp;&amp;</span><span style="color: #000000;">j</span><span style="color: #000000;">&lt;=</span><span style="color: #000000;">i;j</span><span style="color: #000000;">++</span><span style="color: #000000;">)</span><span style="color: #008000;">//</span><span style="color: #008000;">匹配字符串的长度</span><span style="color: #008000;"><br></span><span style="color: #008080;">54</span>&nbsp;<span style="color: #008000;"></span><span style="color: #000000;">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;{<br></span><span style="color: #008080;">55</span>&nbsp;<span style="color: #000000;">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</span><span style="color: #0000ff;">for</span><span style="color: #000000;">&nbsp;(</span><span style="color: #0000ff;">int</span><span style="color: #000000;">&nbsp;k</span><span style="color: #000000;">=</span><span style="color: #000000;">1</span><span style="color: #000000;">;k</span><span style="color: #000000;">&lt;=</span><span style="color: #000000;">Num_Prim[j];k</span><span style="color: #000000;">++</span><span style="color: #000000;">)</span><span style="color: #008000;">//</span><span style="color: #008000;">同一长度的字符串挨个匹配</span><span style="color: #008000;"><br></span><span style="color: #008080;">56</span>&nbsp;<span style="color: #008000;"></span><span style="color: #000000;">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;{<br></span><span style="color: #008080;">57</span>&nbsp;<span style="color: #000000;">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</span><span style="color: #0000ff;">if</span><span style="color: #000000;">&nbsp;(comp(i,k,j)</span><span style="color: #000000;">&amp;&amp;</span><span style="color: #000000;">re[i</span><span style="color: #000000;">-</span><span style="color: #000000;">j]</span><span style="color: #000000;">==</span><span style="color: #000000;">i</span><span style="color: #000000;">-</span><span style="color: #000000;">j)</span><span style="color: #008000;">//</span><span style="color: #008000;">后一句判断前面的字符是否已全部匹配</span><span style="color: #008000;"><br></span><span style="color: #008080;">58</span>&nbsp;<span style="color: #008000;"></span><span style="color: #000000;">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;{<br></span><span style="color: #008080;">59</span>&nbsp;<span style="color: #000000;">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;re[i]</span><span style="color: #000000;">=</span><span style="color: #000000;">i;<br></span><span style="color: #008080;">60</span>&nbsp;<span style="color: #000000;">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;}<br></span><span style="color: #008080;">61</span>&nbsp;<span style="color: #000000;">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;}<br></span><span style="color: #008080;">62</span>&nbsp;<span style="color: #000000;">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;}<br></span><span style="color: #008080;">63</span>&nbsp;<span style="color: #000000;">&nbsp;&nbsp;&nbsp;&nbsp;}<br></span><span style="color: #008080;">64</span>&nbsp;<span style="color: #000000;">&nbsp;&nbsp;&nbsp;&nbsp;</span><span style="color: #0000ff;">for</span><span style="color: #000000;">&nbsp;(</span><span style="color: #0000ff;">int</span><span style="color: #000000;">&nbsp;i</span><span style="color: #000000;">=</span><span style="color: #000000;">0</span><span style="color: #000000;">;i</span><span style="color: #000000;">&lt;=</span><span style="color: #000000;">len_s;i</span><span style="color: #000000;">++</span><span style="color: #000000;">)<br></span><span style="color: #008080;">65</span>&nbsp;<span style="color: #000000;">&nbsp;&nbsp;&nbsp;&nbsp;{<br></span><span style="color: #008080;">66</span>&nbsp;<span style="color: #000000;">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</span><span style="color: #0000ff;">if</span><span style="color: #000000;">&nbsp;(re[i]</span><span style="color: #000000;">&gt;</span><span style="color: #000000;">ans)<br></span><span style="color: #008080;">67</span>&nbsp;<span style="color: #000000;">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;{<br></span><span style="color: #008080;">68</span>&nbsp;<span style="color: #000000;">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;ans</span><span style="color: #000000;">=</span><span style="color: #000000;">re[i];<br></span><span style="color: #008080;">69</span>&nbsp;<span style="color: #000000;">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;}<br></span><span style="color: #008080;">70</span>&nbsp;<span style="color: #000000;">&nbsp;&nbsp;&nbsp;&nbsp;}<br></span><span style="color: #008080;">71</span>&nbsp;<span style="color: #000000;">&nbsp;&nbsp;&nbsp;&nbsp;</span><span style="color: #0000ff;">return</span><span style="color: #000000;">&nbsp;ans;<br></span><span style="color: #008080;">72</span>&nbsp;<span style="color: #000000;">}<br></span><span style="color: #008080;">73</span>&nbsp;<span style="color: #000000;"></span><span style="color: #0000ff;">void</span><span style="color: #000000;">&nbsp;getInput()<br></span><span style="color: #008080;">74</span>&nbsp;<span style="color: #000000;">{<br></span><span style="color: #008080;">75</span>&nbsp;<span style="color: #000000;"><br></span><span style="color: #008080;">76</span>&nbsp;<span style="color: #000000;">&nbsp;&nbsp;&nbsp;&nbsp;</span><span style="color: #0000ff;">char</span><span style="color: #000000;">&nbsp;s[</span><span style="color: #000000;">200</span><span style="color: #000000;">];<br></span><span style="color: #008080;">77</span>&nbsp;<span style="color: #000000;">&nbsp;&nbsp;&nbsp;&nbsp;</span><span style="color: #0000ff;">while</span><span style="color: #000000;">(fin</span><span style="color: #000000;">&gt;&gt;</span><span style="color: #000000;">s</span><span style="color: #000000;">&amp;&amp;</span><span style="color: #000000;">s[</span><span style="color: #000000;">0</span><span style="color: #000000;">]</span><span style="color: #000000;">!=</span><span style="color: #000000;">'</span><span style="color: #000000;">.</span><span style="color: #000000;">'</span><span style="color: #000000;">)<br></span><span style="color: #008080;">78</span>&nbsp;<span style="color: #000000;">&nbsp;&nbsp;&nbsp;&nbsp;{<br></span><span style="color: #008080;">79</span>&nbsp;<span style="color: #000000;"><br></span><span style="color: #008080;">80</span>&nbsp;<span style="color: #000000;">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</span><span style="color: #0000ff;">int</span><span style="color: #000000;">&nbsp;tl</span><span style="color: #000000;">=</span><span style="color: #000000;">strlen(s);<br></span><span style="color: #008080;">81</span>&nbsp;<span style="color: #000000;">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;strcpy(prim[tl][</span><span style="color: #000000;">++</span><span style="color: #000000;">Num_Prim[tl]],s);<br></span><span style="color: #008080;">82</span>&nbsp;<span style="color: #000000;">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</span><span style="color: #0000ff;">if</span><span style="color: #000000;">&nbsp;(tl</span><span style="color: #000000;">&gt;</span><span style="color: #000000;">MAX_len)<br></span><span style="color: #008080;">83</span>&nbsp;<span style="color: #000000;">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;{<br></span><span style="color: #008080;">84</span>&nbsp;<span style="color: #000000;">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;MAX_len</span><span style="color: #000000;">=</span><span style="color: #000000;">tl;</span><span style="color: #008000;">//</span><span style="color: #008000;">字符表中的最大长度字符串</span><span style="color: #008000;"><br></span><span style="color: #008080;">85</span>&nbsp;<span style="color: #008000;"></span><span style="color: #000000;">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;}<br></span><span style="color: #008080;">86</span>&nbsp;<span style="color: #000000;">&nbsp;&nbsp;&nbsp;&nbsp;}<br></span><span style="color: #008080;">87</span>&nbsp;<span style="color: #000000;">&nbsp;&nbsp;&nbsp;&nbsp;</span><span style="color: #0000ff;">while</span><span style="color: #000000;">(fin</span><span style="color: #000000;">&gt;&gt;</span><span style="color: #000000;">s)<br></span><span style="color: #008080;">88</span>&nbsp;<span style="color: #000000;">&nbsp;&nbsp;&nbsp;&nbsp;{<br></span><span style="color: #008080;">89</span>&nbsp;<span style="color: #000000;">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</span><span style="color: #008000;">/*</span><span style="color: #008000;">strcat(str,s);</span><span style="color: #008000;">*/</span><span style="color: #000000;"><br></span><span style="color: #008080;">90</span>&nbsp;<span style="color: #000000;">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;str</span><span style="color: #000000;">+=</span><span style="color: #000000;">s;<br></span><span style="color: #008080;">91</span>&nbsp;<span style="color: #000000;">&nbsp;&nbsp;&nbsp;&nbsp;}<br></span><span style="color: #008080;">92</span>&nbsp;<span style="color: #000000;">&nbsp;&nbsp;&nbsp;&nbsp;len_s</span><span style="color: #000000;">=</span><span style="color: #000000;">str.length();</span><span style="color: #008000;">//</span><span style="color: #008000;">输入字符的长度<br></span><span style="color: #008080;">93</span>&nbsp;<span style="color: #008000;">&nbsp;<br></span><span style="color: #008080;">94</span>&nbsp;<span style="color: #008000;">&nbsp;</span><span style="color: #008000;">//</span><span style="color: #008000;">&nbsp;&nbsp;&nbsp;while(getline(fin,s))</span><span style="color: #008000;">//</span><span style="color: #008000;">多行字符串赋给一个字符串<br></span><span style="color: #008080;">95</span>&nbsp;<span style="color: #008000;">&nbsp;&nbsp;&nbsp;&nbsp;</span><span style="color: #008000;">//</span><span style="color: #008000;">{<br></span><span style="color: #008080;">96</span>&nbsp;<span style="color: #008000;">&nbsp;</span><span style="color: #008000;">//</span><span style="color: #008000;">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;str+=s;<br></span><span style="color: #008080;">97</span>&nbsp;<span style="color: #008000;">&nbsp;&nbsp;&nbsp;&nbsp;</span><span style="color: #008000;">//</span><span style="color: #008000;">}</span><span style="color: #008000;"><br></span><span style="color: #008080;">98</span>&nbsp;<span style="color: #008000;"></span><span style="color: #000000;">}</span></div>
<br><br><br><img src ="http://www.cppblog.com/meizixiong/aggbug/108900.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/meizixiong/" target="_blank">碧云天</a> 2010-03-04 21:24 <a href="http://www.cppblog.com/meizixiong/archive/2010/03/04/108900.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>美丽心情——开博之作</title><link>http://www.cppblog.com/meizixiong/archive/2009/06/21/88232.html</link><dc:creator>碧云天</dc:creator><author>碧云天</author><pubDate>Sun, 21 Jun 2009 12:53:00 GMT</pubDate><guid>http://www.cppblog.com/meizixiong/archive/2009/06/21/88232.html</guid><wfw:comment>http://www.cppblog.com/meizixiong/comments/88232.html</wfw:comment><comments>http://www.cppblog.com/meizixiong/archive/2009/06/21/88232.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/meizixiong/comments/commentRss/88232.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/meizixiong/services/trackbacks/88232.html</trackback:ping><description><![CDATA[<p>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 今天父亲节，中午吃完饭之后，拔通了家里的电话，接电话的正是爸爸，几句谈笑之后，我直转正题：爸爸，今天是父亲节，祝&#8230;&#8230;未等我把话说完，爸爸几句话想要转开的意思，其实我鼓起勇气准备第一次亲口祝他节日快乐，而他却还不太好意思，毕竟在中国人们还是习惯了含蓄，把话埋在心里，以往我也是这样想，就一直没有在这种节日时往家里打过电话，但我知道，爸爸今天很高兴，像个孩子一般。我也长长舒了口气，心里特别舒畅，因为我没有觉得把爱表达出来会有什么不妥，反而，我与爸爸更能聊得开了，现在，作为女儿的我已经完全不用他们再操什么心了，现在，他们再也不必像以前一样唠唠叨叨什么了，然而，与此同时，他们快要慢慢地在心理上&#8220;蜕化&#8221;为孩子了，更需要子女与他们的交流，更需要子女对他们的关心了，而一声节日的祝福，于我而言，几句话语而已，而在他们心里，比蜜还甜。而我，何尝不是呢，爸爸妈妈，我爱你们！<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 今天，也是一位好友的生日，昨晚给他发了祝福的短信，收到了他真心的感谢，心里真的很高兴。作为朋友，我一直坚信我们的友谊很深厚，于是平时过节也就心里表达着祝福和关怀，但很少亲口说出来，但昨晚的短信，内容虽然很平凡，也就表达了一下美好的祝福，但朋友回了几个字，也是很简单的几个字，我却能感觉到他内心的开心，我也很开心，我会一直默默地祝福你的，亲爱的朋友！<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 今天周末，傍晚，天气凉爽，吃过晚饭，我慵懒地准备回实验室，BF说带我去隔壁学校转转，我们学校是工科院校，人才济济，校风严谨，拥有迷你型的校园，那个学校却不一样，它带有更多的历史人文气息，校园里透露着一种开阔与舒适，美女如云，设施齐全，是一所百年老校。之前一直都没怎么过来玩过，当我发现它们的操场时，我兴奋的心情开始把我平静的心打开，那里的器械是我见过的种类最多的，而且很多器械我以前都没在哪里见过，更重要的是那里还有两把可以荡起来的坐椅，也算是&#8220;秋千&#8221;的一种，随着&#8220;秋千&#8221;的此起彼伏，我的心也跟着荡漾开来，先是一阵&#8220;恐高&#8221;，再后来就是享受了，风吹过长发，前方的足球场上活跃着不少矫健的身影，远方，天空的云正在发生着美妙的变化，淡蓝的天空，在一方晚霞的照映下显得格外漂亮，风慢慢大起来，慢慢地空中的乌去多了些，风搅动着那些云，像有一双看不见的手在偌大的画面上作着泼墨的山水画&#8230;&#8230;一切都汇聚成美的元素，流到心里，滋养了我干涸的心灵。<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 生活中不是没有美，而是我们常常忘了去发现，去尝试，去放开心体验，研究生的生活是单调了些，身上的压力是越来越大了些，然而这也不妨碍我们去丰富自己的生活和人生，除了现在的专业学习以外，我也可以追求自己的兴趣爱好，我也可以好好去欣赏学校外面的风景，我也可以去外面的世界中发现新的亮点，我可以把那所学校作为我的后花园&#8230;&#8230;心有多宽，生活就会有多宽，生活中的欢乐也会多起来！<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 所以，心宽了，皱眉报怨的时间就可以节约下来追求自己的兴趣爱好，追求自己想要的生活，只要有了梦想和追求，你的眼睛将不再没有光采，你的面容将不再有了愁容，你将不再消极，而是拥有美丽心情！<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 现在，让我大声宣布：开博啦！不管多忙，我都会本着一颗认真生活的心，将这里好好打点，希望以后回过头来时，发现，原来生活赐予我的比我想像的还有多！<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 对生活心存感激！</p>
<img src ="http://www.cppblog.com/meizixiong/aggbug/88232.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/meizixiong/" target="_blank">碧云天</a> 2009-06-21 20:53 <a href="http://www.cppblog.com/meizixiong/archive/2009/06/21/88232.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item></channel></rss>