Pagini recente » Cod sursa (job #3189307) | Cod sursa (job #2037921) | Cod sursa (job #1829198) | Cod sursa (job #761594) | Cod sursa (job #2968276)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("flori.in");
ofstream fout("flori.out");
int v[1001][1001];
int main()
{
int n, m, z, x1, y1, x2, y2, x, max=0, maxcnt;
fin>>n>>m;
for(int i=1;i<=n;i++)
for(int j=1;j<=m;j++)
fin>>v[i][j];
fin>>z;
for(int k=1;k<=z;k++){
fin>>x1>>y1>>x2>>y2>>x;
for(int i=x1;i<=x2;i++){
for(int j=y1;j<=y2;j++){
v[i][j]+=x;
}
}
}
for(int i=1;i<=n;i++)
for(int j=1;j<=m;j++){
if(v[i][j]==max)
maxcnt++;
if(v[i][j]>max){
max=v[i][j];
maxcnt=1;
}
}
fout<<max<<" "<<maxcnt;
return 0;
}