Pagini recente » Cod sursa (job #2892543) | Cod sursa (job #933257) | Cod sursa (job #2285180) | Cod sursa (job #1486565) | Cod sursa (job #863807)
Cod sursa(job #863807)
#include<fstream>
using namespace std;
ifstream f("ferma2.in");
ofstream g("ferma2.out");
int n,k,i,j,x,ii,jj,maxi,mini,p,sum,jj1,a[1001][1001],s[1001][1001];
char sir[1000*110];
int ianr()
{
while(sir[p]<'0'||sir[p]>'9')
++p;
int nr=0;
while(sir[p]>='0'&&sir[p]<='9')
nr=nr*10+sir[p]-'0',++p;
return nr;
}
int main()
{f>>n>>k;
f.get();
for(i=1;i<=n;++i)
{
f.getline(sir,110000);
p=0;
for(j=1;j<=i;++j)
{
a[i][j]=ianr();
s[i][j]=s[i][j-1]+a[i][j],maxi+=a[i][j];
}
}
x=n-k;
mini=maxi+1;
for(i=x;i<=n;++i)
for(j=x;j<=i;++j)
{sum=0;
ii=i;
jj=j;
for(jj1=1;jj1<=x;++jj1)
{sum+=s[ii][jj]-s[ii][jj-(n-k-jj1+1)];
--ii;
--jj;
}
if(mini>sum)
mini=sum;
}
g<<maxi-mini<<'\n';
return 0;
}