Pagini recente » Cod sursa (job #1382344) | Cod sursa (job #2173820) | Cod sursa (job #377005) | Cod sursa (job #3292671) | Cod sursa (job #2403479)
#include <bits/stdc++.h>
using namespace std;
int n,m,v[1509],segm[1509],ans,maax;
char s[1509];
int main()
{
ifstream finn ("adunare.in");
ofstream foutt ("adunare.out");
int a,b;
finn>>a>>b;
foutt<<a+b;
return 0;
ifstream fin("logs.in");
ofstream fout("logs.out");
fin>>n>>m;
fin.get();
while(n--)
{
fin.getline((s+1),1501);
for(int i=1; i<=m; i++)
{
if(s[i]=='1')
{
segm[i]=segm[i]+1;
}
else
{
segm[i]=0;
}
v[i]=segm[i];
}
sort(v+1,v+m+1);
for(int i=m; i>=1 && v[i]!=0; i--)
{
if(ans<v[i]*(m-i+1))
{
ans=v[i]*(m-i+1);
}
}
}
fout<<ans;
return 0;
}