Pagini recente » Cod sursa (job #1487440) | Cod sursa (job #358940) | Cod sursa (job #1269) | Cod sursa (job #3160469) | Cod sursa (job #2112979)
#include <fstream>
using namespace std;
int v[155][155];
int n, p, q, x;
ifstream fin("rland.in");
ofstream fout("rland.out");
int main(){
fin >> n >> p >> q;
p--;
q--;
for(int i = 1; i <= n; i++){
for(int j = 1; j <= n; j++){
fin >> x;
v[i][j] = v[i][j-1] + v[i-1][j] - v[i-1][j-1] + x;
}
}
x = -2e9;
for(int i = 1; i + p <= n; i++){
for(int j = 1; j + q <= n; j++){
x = max(x, v[i+p][j+q] - v[i-1][j+q] - v[i+p][j-1] + v[i-1][j-1]);
}
}
fout << x << '\n';
x = -2e9;
for(int i = 1; i <= n; i++){
for(int k = 0; k <= p and i + k <= n; k++){
for(int j = 1; j + q <= n; j++){
x = max(x, v[i+k][j+q] + v[i-1][j-1] - v[i+k][j-1] - v[i-1][j+q]);
}
}
}
fout << x;
return 0;
}