fork download
  1. //Lib
  2. #include<cstdio>
  3. #include<cstring>
  4. #include<cstdlib>
  5. #include<cmath>
  6. #include<ctime>
  7.  
  8. #include<iostream>
  9. #include<algorithm>
  10. #include<vector>
  11. #include<string>
  12. #include<queue>
  13. #include<stack>
  14. #include<set>
  15. #include<map>
  16. using namespace std;
  17. //Macro
  18. #define rep(i,a,b) for(int i=a,tt=b;i<=tt;++i)
  19. #define drep(i,a,b) for(int i=a,tt=b;i>=tt;--i)
  20. #define erep(i,e,x) for(int i=x;i;i=e[i].next)
  21. #define irep(i,x) for(__typeof(x.begin()) i=x.begin();i!=x.end();i++)
  22. #define read() (strtol(ipos,&ipos,10))
  23. #define sqr(x) ((x)*(x))
  24. #define pb push_back
  25. #define PS system("pause");
  26. typedef long long ll;
  27. typedef pair<int,int> pii;
  28. const int oo=~0U>>1;
  29. const double inf=1e100;
  30. const double eps=1e-6;
  31. string name="", in=".in", out=".out";
  32. //Var
  33. int n,m,t;
  34. int sum[2][58][58];
  35. int w[58][58][2508],f[58][2508];
  36. void Init()
  37. {
  38. scanf("%d%d%d\n",&n,&m,&t);
  39. char s[58];
  40. rep(i,1,n)
  41. {
  42. gets(s+1);
  43. rep(j,1,m)
  44. {
  45. sum[0][i][j]=sum[0][i][j-1]+(s[j]=='0');
  46. sum[1][i][j]=sum[1][i][j-1]+(s[j]=='1');
  47. }
  48. }
  49. }
  50. void Work()
  51. {
  52. rep(i,1,n)rep(t,1,m)rep(j,1,m)rep(k,0,j-1)
  53. w[i][j][t]=max(w[i][j][t],w[i][k][t-1]+max(sum[0][i][j]-sum[0][i][k],sum[1][i][j]-sum[1][i][k]));
  54. memset(f,-1,sizeof f);
  55. f[0][0]=0;
  56. rep(i,1,n)rep(j,0,t)drep(k,t-j,0)
  57. if(f[i-1][k]>=0)
  58. f[i][k+j]=max(f[i-1][k]+w[i][m][j],f[i][k+j]);
  59. cout<<f[n][t]<<endl;
  60. }
  61. int main()
  62. {
  63. // freopen((name+in).c_str(),"r",stdin);
  64. // freopen((name+out).c_str(),"w",stdout);
  65. Init();
  66. Work();
  67. return 0;
  68. }
Not running #stdin #stdout 0s 0KB
stdin
Standard input is empty
stdout
Standard output is empty