Pagini recente » Cod sursa (job #3197574) | Cod sursa (job #1721656) | Cod sursa (job #1108825) | Cod sursa (job #1229743) | Cod sursa (job #638197)
Cod sursa(job #638197)
#include<fstream>
using namespace std;
ifstream in("ferma2.in");
ofstream out("ferma2.out");
long long v[1001][1001],n,k,s;
int ok(int lin,int col)
{
int i,p=0,b=n-k;
if(lin+b-1>n || col+b-1>n)
return s;
for(i=1;i<=b;i++)
p+=v[lin+i-1][col+i-1]-v[lin+i-1][col-1];
return p;
}
int main()
{
long long max=0,i,j,x;
in>>n>>k;
for(i=1;i<=n;i++)
for(j=1;j<=i;j++)
{
in>>x;
v[i][j]=v[i][j-1]+x;
s+=x;
}
for(i=1;i<=n;i++)
for(j=1;j<=i;j++)
{
x=s-ok(i,j);
if(x>max)
max=x;
}
out<<max<<'\n';
return 0;
}