锘??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>&#20037;&#20037;&#31934;&#21697;&#20013;&#25991;&#23383;&#24149;&#26080;&#30721;&#32511;&#24040;&#20154;&#44;&#20122;&#27954;&#20154;&#25104;&#32593;&#20122;&#27954;&#27431;&#27954;&#26080;&#30721;&#20037;&#20037;&#44;&#22825;&#22825;&#29245;&#22825;&#22825;&#29408;&#20037;&#20037;&#20037;&#32508;&#21512;&#40635;&#35910;</title><link>http://m.shnenglu.com/cpp-stu2/</link><description>cpp_stu2's Land</description><language>zh-cn</language><lastBuildDate>Mon, 30 Jun 2025 07:28:02 GMT</lastBuildDate><pubDate>Mon, 30 Jun 2025 07:28:02 GMT</pubDate><ttl>60</ttl><item><title>鍏充簬rock鐨勪竴浜涙�濊�?/title><link>http://m.shnenglu.com/cpp-stu2/archive/2007/06/30/27266.html</link><dc:creator>濮滈洦鐢?/dc:creator><author>濮滈洦鐢?/author><pubDate>Sat, 30 Jun 2007 03:00:00 GMT</pubDate><guid>http://m.shnenglu.com/cpp-stu2/archive/2007/06/30/27266.html</guid><wfw:comment>http://m.shnenglu.com/cpp-stu2/comments/27266.html</wfw:comment><comments>http://m.shnenglu.com/cpp-stu2/archive/2007/06/30/27266.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://m.shnenglu.com/cpp-stu2/comments/commentRss/27266.html</wfw:commentRss><trackback:ping>http://m.shnenglu.com/cpp-stu2/services/trackbacks/27266.html</trackback:ping><description><![CDATA[
瀵箁ock鐨勪竴浜涙�濊�冧笌闂
棰樼洰
瀹濆簱閫氶亾錛圧ock錛?
鎺㈠疂鐨勬梾紼嬩粛鐒剁戶緇腑錛岀敱浜庝綘鐨勫府鍔╋紝灝忓彲鍙垚鍔熺偣鐕冧簡鐏樀錛岄伩榪囦簡璁稿鑷村懡鐨勯櫡闃憋紝緇堜簬鏉ュ埌浜嗗孌跨殑姝ｅ巺涓�傚ぇ鍘呯殑鍦伴潰鏄敱涓�鍧楀潡澶у皬涓�鑷寸殑姝ｆ柟褰㈢煶鍧楃粍鎴愮殑錛岃繖浜涚煶鍧楀垎涓洪粦銆佺櫧涓よ壊錛岀粍鎴愪簡涓�涓猰*n鐨勭煩褰紝鍦ㄥ叾涓竴涓煶鍧楃殑涓嬮潰灝辨槸閫氬線钘忓疂搴撶殑閫氶亾銆傚皬鍙彲涓嶅彲鑳戒竴涓竴涓煶鍧楃殑灝濊瘯錛屽洜涓烘湁浜涚煶鍧楀畨瑁呬簡鏈哄叧錛屼竴紕板氨浼氳Е鍙戯紝鏁翠釜瀹涔熼殢涔嬪�掑銆傛牴鎹棌瀹濆浘璁拌澆錛岄�氶亾鍦ㄦ煇涓�鐗瑰畾鐨勫尯鍩熶腑錛岃繖涓尯鍩熸槸涓�涓敱鏁頒釜鐭沖潡緇勬垚鐨勯潰縐笉涓?鐨勫皬鐭╁艦錛屽畠鐨勫洓鏉¤竟涓庡ぇ鍘呭湴闈㈢殑杈瑰鉤琛屻�傚鏋滃鏁翠釜澶у巺鍦伴潰浠繪剰鍒掑垎鐭╁艦錛岄偅涔堝湪鎵�鏈夌煩褰腑錛岃繖涓尯鍩熺殑榛戣壊鐭沖潡鏁扮洰鍑忓幓鐧借壊鐭沖潡鏁扮洰鎵�寰楃殑宸槸鏈�澶х殑銆?
灝忓彲鍙笇鏈涘拰浣犲垎宸ワ紝鐢變粬鏉ラ�夋嫨鍖哄煙錛屼綘鏉ヨ綆楅粦銆佺櫧涓よ壊鐭沖潡鐨勬暟鐩樊S銆傝繖鏍峰氨鑳藉揩閫熻�屽噯紜殑紜閫氶亾鎵�鍦ㄧ殑鍖哄煙銆傝棌瀹濆浘涓婅榪欎釜鍖哄煙涓殑鐭沖潡閮芥病鏈夊畨瑁呮満鍏籌紝鍙紜畾浜嗗尯鍩燂紝灝變竴瀹氳兘鎵懼埌閫氶亾銆傚疂钘忓氨鍦ㄧ溂鍓嶄簡錛屽姞娌瑰惂錛?
錛堝亣璁劇敤1琛ㄧず榛戣壊鐭沖潡錛岀敤0琛ㄧず鐧借壊鐭沖潡錛?

杈撳叆錛氳緭鍏ユ枃浠剁殑絎竴琛屼負涓や釜鏁存暟m,n (1<=m,n<=400).
浠ヤ笅m琛岋紝姣忚n涓瓧絎︼紝姣忎釜瀛楃閮芥槸0鎴?銆?

杈撳嚭錛氳緭鍑烘枃浠朵粎涓�涓暟錛岃〃紺烘墍鏈夊彲鑳界殑鍖哄煙涓璖鍊鹼紙瑙佸墠鏂囨弿榪幫級鏈�澶х殑涓�涓紝杈撳嚭榪欎釜鍊煎嵆鍙�?

鏍蜂緥錛?
杈撳叆錛?
3 4
1011
1111
1111
杈撳嚭錛?
10
鍥涢噸寰幆錛?
鍥涢噸寰幆姣旇緝綆�鍗曪紝鍗蟲眰
area(x1,x2,y1,y2)=area(0,0,x2,y2)-area(0,0,x1,y2)-area(0,0, x2,y1)+area(0,0, x1, y2)

涓夐噸寰幆
    涓夐噸寰幆浣跨敤dp 浣嗘槸鎴戠敤浜嗕笁浣嶆暟緇勫彲鑳借秴絀洪棿銆?
鎻愰棶
1錛?鎴戠敤涓夐噸寰幆鏃剁敤鐨勬槸&#8220;绔栫┓涓撅紝妯猟p&#8221;錛屾垜鎯寵杈懼埌&#8220;妯珫閮借dp&#8221;錛屾�庝箞鍔烇紵
2錛?鎴戠殑紼嬪簭鍦ㄤ笅闈?
         涓夐噸寰幆
#include<fstream>
using namespace std;
ifstream fin ("rock.in");
ofstream fout ("rock.out");
int m,n;
int maxx=0;
int a[400][400];
int b[400][400][400];
void ask1(int x,int y,int lng)
{
	int sum=0;
	for (int i=y;i<=lng;i++)
	    sum+=a[x][i];
    b[x][y][lng]=sum;
}
void ask2(int x,int y,int lng)
{
	int now=0;
	int maxj=0;
	for (int j=x;j<m;j++)
	{
		now+=b[j][y][lng];
		if (now>maxj) maxj=now;
		else if (now<0) now=0;
	}
	if (maxj>maxx) maxx=maxj;
}
int main (void)
{
	fin>>m>>n;
	char tmp;
	for (int i=0;i<m;i++)
        for (int j=0;j<n;j++)
        {
		    fin>>tmp;
			a[i][j]=(tmp=='0')?-1:1;
        }
	for (int x=0;x<m;x++)
        for (int y=0;y<n;y++)
		    for (int lng=y;lng<n;lng++)
                ask1(x,y,lng);
	for (int x=0;x<m;x++)
        for (int y=0;y<n;y++)
		    for (int lng=y;lng<n;lng++)
                ask2(x,y,lng);
	fout<<maxx<<endl;
	return 0;
}
鍥涢噸寰幆
#include<fstream>
using namespace std;
ifstream fin ("rock.in");
ofstream fout ("rock.out");
int palace[400][400]={0},b[400][400]={0};
int main (void)
{
    long max=0;
	int N,M;
	fin>>N>>M;
	for (int i=0;i<N;i++)
		for (int j=0;j<M;j++)
	    {
		    char a;
			fin>>a;
		    palace[i][j]=a-'0';
			if (palace[i][j]==0) palace[i][j]=-1;
	    }
	for (int i=0;i<N;i++)
		for (int j=0;j<M;j++)
            for (int from1=0;from1<=i;from1++)
		        for (int from2=0;from2<=j;from2++)
                    b[i][j]+=palace[from1][from2];
	for (int i=0;i<N;i++)
        for (int j=0;j<M;j++)
            for (int x=i;x<N;x++)
		        for (int y=j;y<M;y++)
		        {
		            long now=0;
					now=b[x][y]-b[x][j-1]-b[i-1][y]+b[i-1][j-1];
					if (now>max) max=now;
		        }
	fout<<max<<endl;
	return 0;
}

 <img src ="http://m.shnenglu.com/cpp-stu2/aggbug/27266.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://m.shnenglu.com/cpp-stu2/" target="_blank">濮滈洦鐢?/a> 2007-06-30 11:00 <a href="http://m.shnenglu.com/cpp-stu2/archive/2007/06/30/27266.html#Feedback" target="_blank" style="text-decoration:none;">鍙戣〃璇勮</a></div>]]></description></item></channel></rss>                     <footer>
<div class="friendship-link">
<p>感谢您访问我们的网站，您可能还对以下资源感兴趣：</p>
<a href="http://m.shnenglu.com/" title="&#31934;&#21697;&#35270;&#39057;&#20037;&#20037;&#20037;&#20037;">&#31934;&#21697;&#35270;&#39057;&#20037;&#20037;&#20037;&#20037;</a>

<div class="friend-links">


</div>
</div>

</footer>

<a href="http://www.qushouji.cn" target="_blank">久久婷婷国产剧情内射白浆
</a>|
<a href="http://www.101922.cn" target="_blank">久久久久亚洲AV综合波多野结衣</a>|
<a href="http://www.asook.cn" target="_blank">久久777国产线看观看精品</a>|
<a href="http://www.gkwtw.cn" target="_blank">久久精品二区</a>|
<a href="http://www.gx177.cn" target="_blank">国产精品一区二区久久国产</a>|
<a href="http://www.84993.com.cn" target="_blank">99久久免费国产精品</a>|
<a href="http://www.bjhswt.com.cn" target="_blank">久久久一本精品99久久精品88</a>|
<a href="http://www.xahjqc.cn" target="_blank">久久久精品人妻一区二区三区蜜桃</a>|
<a href="http://www.shangbi.com.cn" target="_blank">国产精品久久国产精品99盘</a>|
<a href="http://www.xslbjb.cn" target="_blank">婷婷久久五月天</a>|
<a href="http://www.gbtu.cn" target="_blank">亚洲综合精品香蕉久久网97</a>|
<a href="http://www.yrjiameng.cn" target="_blank">久久精品国产亚洲av麻豆蜜芽</a>|
<a href="http://www.disidai.cn" target="_blank">久久免费视频网站</a>|
<a href="http://www.zfrnhbv.com.cn" target="_blank">久久精品日日躁夜夜躁欧美</a>|
<a href="http://www.ouseshi.cn" target="_blank">久久国产视频网</a>|
<a href="http://www.zhoupeng520.cn" target="_blank">国产精品久久波多野结衣</a>|
<a href="http://www.jkzgjkzl.org.cn" target="_blank">国产亚洲美女精品久久久2020</a>|
<a href="http://www.zhoushandk.cn" target="_blank">成人a毛片久久免费播放</a>|
<a href="http://www.xiaomaidou.cn" target="_blank">久久久噜噜噜久久中文福利</a>|
<a href="http://www.ersunle.cn" target="_blank">久久无码中文字幕东京热</a>|
<a href="http://www.baicar.cn" target="_blank">国产99久久久久久免费看</a>|
<a href="http://www.www5303.cn" target="_blank">国产精品久久久亚洲</a>|
<a href="http://www.mens-uno.com.cn" target="_blank">免费精品久久天干天干</a>|
<a href="http://www.hbrsksy.cn" target="_blank">亚洲精品国产综合久久一线</a>|
<a href="http://www.9lang.cn" target="_blank">国产精自产拍久久久久久蜜</a>|
<a href="http://www.vbzc.cn" target="_blank">伊人久久大香线蕉精品</a>|
<a href="http://www.funziot.cn" target="_blank">久久久综合九色合综国产</a>|
<a href="http://www.siteni.cn" target="_blank">久久久精品人妻一区二区三区蜜桃</a>|
<a href="http://www.qcbijj.cn" target="_blank">久久狠狠爱亚洲综合影院
</a>|
<a href="http://www.kanqiuwang.cn" target="_blank">久久久久女人精品毛片</a>|
<a href="http://www.bolson.cn" target="_blank">久久丫忘忧草产品</a>|
<a href="http://www.tf78.cn" target="_blank">亚洲国产精品狼友中文久久久</a>|
<a href="http://www.xishuixian.com.cn" target="_blank">精品欧美一区二区三区久久久
</a>|
<a href="http://www.mingyixiu.cn" target="_blank">91久久精品国产免费直播</a>|
<a href="http://www.zjjhart.cn" target="_blank">国产精品一久久香蕉产线看</a>|
<a href="http://www.pygsbdg.cn" target="_blank">久久人人爽人人爽人人片av高请</a>|
<a href="http://www.jw62.cn" target="_blank">久久久精品久久久久影院</a>|
<a href="http://www.west126.cn" target="_blank">久久无码专区国产精品发布</a>|
<a href="http://www.bassaphoto.cn" target="_blank">久久久久久精品无码人妻</a>|
<a href="http://www.chengrenshop.com.cn" target="_blank">久久只这里是精品66</a>|
<a href="http://www.heizhuai.cn" target="_blank">久久久久久久久久久</a>|
<script>
(function(){
    var bp = document.createElement('script');
    var curProtocol = window.location.protocol.split(':')[0];
    if (curProtocol === 'https') {
        bp.src = 'https://zz.bdstatic.com/linksubmit/push.js';
    }
    else {
        bp.src = 'http://push.zhanzhang.baidu.com/push.js';
    }
    var s = document.getElementsByTagName("script")[0];
    s.parentNode.insertBefore(bp, s);
})();
</script>
</body>