-
Notifications
You must be signed in to change notification settings - Fork 1
/
二哥种花生.cpp
34 lines (34 loc) · 1.07 KB
/
二哥种花生.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
#include<iostream>
using namespace std;
int main()
{
int l,w,p;
cin>>l>>w;
int **store=new int*[l];
for(int i=0;i<l;i++)store[i]=new int[w];
for (int i = 0; i < l; ++i)
for (int j = 0; j < w; ++j)
{
cin >> p;
if(i==0&&j==0)store[i][j]=p;
else if(i==0&&j>0)store[i][j]=p+store[i][j-1];
else if(i>0&&j==0)store[i][j]=p+store[i-1][j];
else store[i][j]=p+store[i][j-1]+store[i-1][j]-store[i-1][j-1];
}
int a, b,max(0),temp(0);
cin>>a>>b;
for(int i = a - 1; i < l; ++i)
for (int j = b - 1; j < w; ++j)
{
if(i==a-1&&j==b-1)temp=store[i][j];
else if(i==a-1&&j>b-1)temp=store[i][j]-store[i][j-b];
else if(i>a-1&&j==b-1)temp=store[i][j]-store[i-a][j];
else temp=store[i][j]-store[i-a][j]-store[i][j-b]+store[i-a][j-b];
max=max>temp?max:temp;
}
cout<<max;
for (int i = 0; i < l; ++i)
delete[] store[i];
delete[] store;
return 0;
}