Pagini recente » Istoria paginii runda/9_martie_simulare_oji_2024_clasa_10 | Cod sursa (job #118107) | Cod sursa (job #2669583) | Cod sursa (job #1238629) | Cod sursa (job #642651)
Cod sursa(job #642651)
#include<iostream>
#include<fstream>
using namespace std;
long long a[1008][1008],sum,s_crt,t,mini=101000000;
int n,k,i,j,w;
int r;
FILE *f=fopen("ferma2.in","r");
FILE *g=fopen("ferma2.out","w");
int main(void)
{
fscanf(f,"%d%d",&n,&k);
for (i=1;i<=n;i++)
for (j=1;j<=i;j++)
{
fscanf(f,"%lld",&a[i][j]);
sum+=a[i][j];
a[i][j]=a[i][j]+a[i-1][j-1];
}
int m=n-k;
for (i=n;i>=m;i--)
for (j=i;j>=m;j--)
{
s_crt=0;
r=m;
for(t=j;t>j-m;t--)
{
s_crt+=(a[i][t]-a[i-r][t-r]);
r--;
}
if (s_crt<mini)
mini=s_crt;
}
fprintf(g,"%lld ",sum-mini);
}