C++博客-C++天空

C++博客-C++天空http://www.cppblog.com/cpp-stu2/cpp_stu2's Landzh-cnThu, 09 Apr 2026 11:12:41 GMTThu, 09 Apr 2026 11:12:41 GMT60关于rock的一些思考http://www.cppblog.com/cpp-stu2/archive/2007/06/30/27266.html姜雨生姜雨生Sat, 30 Jun 2007 03:00:00 GMThttp://www.cppblog.com/cpp-stu2/archive/2007/06/30/27266.htmlhttp://www.cppblog.com/cpp-stu2/comments/27266.htmlhttp://www.cppblog.com/cpp-stu2/archive/2007/06/30/27266.html#Feedback0http://www.cppblog.com/cpp-stu2/comments/commentRss/27266.htmlhttp://www.cppblog.com/cpp-stu2/services/trackbacks/27266.html 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;jmaxj) 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>tmp; a[i][j]=(tmp=='0')?-1:1; } for (int x=0;x 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>a; palace[i][j]=a-'0'; if (palace[i][j]==0) palace[i][j]=-1; } for (int i=0;imax) max=now; } fout<

姜雨生 2007-06-30 11:00 发表评论

]]>