~生如夏花

摘要： [A] A Breaking Computer时间限制: 1000 ms　内存限制: 65535 K问题描述Oh my god.My computer is break.When I writing something,the home and the end always is working.But I also write too quakily,even I don't see the screen.OK,when I finish a work ,can you tell me the work become in end?We modified the sample out 阅读全文

摘要： 题意：就是给你一个mXn的矩阵，然后让你在其中找一个和最大的xXy的矩阵。。。思路：我觉得dp就是递推，根据前面的推出后面的，每个矩阵的和我有右下角的点记录：dp[i][j]....代码实现：#include<stdio.h>#include<string.h>int a[1001][1001],dp[1001][1001]={0};int T,m,n,x,y,i,j,max;int nima1(int i){ int sum=0,j; for(j=1;j<=y;j++) sum=sum+a[i][j]-a[i-x][j]; return sum;}int n.. 阅读全文