Pagini recente » cevaonioji | Monitorul de evaluare | Arhiva de probleme | Cod sursa (job #698728) | Cod sursa (job #827095)
Cod sursa(job #827095)
#include <fstream>
#include <vector>
#include <limits>
#include <algorithm>
inline void parsare(unsigned *psmax, unsigned short r,const std::vector<short> &ci,
const std::vector<unsigned short> &matrice, const unsigned short n,const unsigned short m, bool flag);
int main(){
std::ifstream fin("elimin.in");
std::ofstream fout("elimin.out");
unsigned short m,n,r,c;
fin>>m>>n>>r>>c;
bool inv=false;
if(m<n){inv=true; unsigned short temp=m; m=n; n=temp; temp=r; r=c; c=temp;}
std::vector<unsigned short> matrice(n*m);
if(inv)
for(unsigned short ci=0;ci<n;ci++)
for(unsigned short ri=0;ri<m;++ri)
fin>>matrice[ci*n+ri];
else
for(unsigned short ri=0;ri<m;++ri)
for(unsigned short ci=0;ci<n;ci++)
fin>>matrice[ci*n+ri];
unsigned smax=0;
if(c==0) parsare(&smax,r,std::vector<short>(),matrice,n,m,false);
else if(c==n || r==m ) smax=0;
else{
bool reverse=false;
if(c>(n/2)){ reverse=true; c = n-c; }
short i=0;
std::vector<short> ci(c,-1);
while(i>-1){
if(ci[i]==n-c+i) ci[i--]=-1;
else{
if(i==0) ci[i]++;
else if(ci[i]==-1) ci[i]=ci[i-1]+1;
else ci[i]++;
if(i==c-1) parsare(&smax,r,ci,matrice,n,m,reverse);
else i++;
}
}
}
fout<<smax<<'\n';
}
inline void parsare(unsigned *psmax, unsigned short r,const std::vector<short> &ci,
const std::vector<unsigned short> &matrice, const unsigned short n,const unsigned short m, bool flag){
std::vector<unsigned> rowssums(m,0);
unsigned c=0;
for(unsigned short i=0;i<n;++i){
bool inci;
if(c>=ci.size()) inci=false;
else if(i==ci[c]){ inci=true; ++c; }
else inci = false;
if(flag==inci) for(unsigned j=0;j<m;++j) rowssums[j]+=matrice[i*n+j];
}
std::sort(rowssums.begin(),rowssums.end());
unsigned totalrows=0;
for(unsigned i=r;i<rowssums.size();++i) totalrows+=rowssums[i];
if(totalrows>*psmax) *psmax=totalrows;
}