Pagini recente » Cod sursa (job #1905634) | Istoria paginii runda/marinela/clasament | Cod sursa (job #1922807) | Cod sursa (job #2312617) | Cod sursa (job #1727410)
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
int v[100];
void quicksort(int st,int dr)
{
int i,j,aux;
if(st<dr)
{
aux=v[st];
i=st;
j=dr;
while(i<j)
{
while(i<j && v[j]>=aux)
j--;
v[i]=v[j];
while(i<j && v[i]<=aux)
i++;
v[j]=v[i];
}
v[i]=aux;
quicksort(st,i-1);
quicksort(i+1,dr);
}
}
int main()
{
int a[17][17],n,m,suma_initiala=0;
ifstream f("flip.in");
ofstream g("flip.out");
f>>n>>m;
for(int i=1;i<=n;i++)
for(int j=1;j<=m;j++)
{
f>>a[i][j];
suma_initiala+=a[i][j];
}
int sol=0,suma_2=suma_initiala;
for(int i=1;i<=n;i++)
for(int j=1;j<=m;j++)
{
suma_2+=a[i][j]*(-1);
if(suma_2>=suma_initiala)
{
sol=suma_2;
suma_initiala=suma_2;
}
else suma_2=suma_2+a[i][j];
}
cout<<sol;
}