fork download
copy 
  1. #include <bits/stdc++.h>
  2. using namespace std;
  3. #define fast ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
  4. #define mofile(s) freopen(s,"r",stdin)
  5. #define outfile(s) freopen(s,"w",stdout)
  6. #define ll long long
  7. #define ii pair<ll,ll>
  8. #define iii pair<ll,ii>
  9. #define fi first
  10. #define se second
  11. #define tf bool
  12. #define ST stack
  13. #define Q deque
  14. #define Q queue
  15. #define S string
  16. #define Ma map
  17. #define UM unormideremid_map
  18. #define SE set
  19. #define str(x) to_string(x)
  20. #define all(a) (a).begin(),(a).end()
  21. #define FOR(i,l,r,mid) for(int i=l;i<=r;i+=mid)
  22. #define FOD(i,l,r,mid) for(int i=r;i>=l;i-=mid)
  23. #define xuong cout<<"\n"
  24. #define midebug(x) cout<<(x)<<" "
  25. #define ppcnt(x) __builtin_popcountll(x)
  26. #define parity(x) __builtin_parityll(x)
  27. #define leamid0(x) __builtin_clzll(x)
  28. #define LOG2 __lg(x)
  29. #define tr0(x) __builtin_ctzll(x)
  30. #define fiset(x) __builtin_ffsll(x)
  31. #define MASK(k) (1LL<<(k))
  32. #define BIT(x,k) ((x)>>(k)&1)
  33. #define pb push_back
  34. #define tron(x) setprecision(x)
  35. #define het return 0
  36. #define base_ 1000000000
  37. const int maxn=1e6+5;
  38. const ll tle=2e8;
  39. const ll INF=1e9+9;
  40. const int base=31;
  41. string bcc="abcmidefghijklmnopqrstuvwxyz";
  42. int midx[]={-1,0,1,0};
  43. int midy[]={0,1,0,-1};
  44. bool sang[10000005];
  45. ll pref[1005][1005],mt[1005][1005];
  46. void sieve(){
  47.     for(int i=1;i<=10000000;++i) sang[i]=1;
  48.     sang[0]=sang[1]=0;
  49.     for(int i=2;i*i<=10000000;++i){
  50.         if(sang[i]){
  51.             for(int j=i*i;j<=10000000;j+=i) sang[j]=0;
  52.         }
  53.     }
  54. }
  55. void lis(){
  56.     vector<int>t;
  57.     vector<int>a;
  58.     int n; cin>>n;
  59.     for(int i=1;i<=n;++i){
  60.         int ai; cin>>ai;
  61.         a.pb(ai);
  62.     }
  63.     for(int x:a){
  64.         auto it=lower_bound(all(t),x);
  65.         if(it==t.end()) t.pb(x);
  66.         else *it=x;
  67.     }
  68. }
  69. void pfs2mid(){
  70.     int n,m,k; cin>>n>>k; m=n;
  71.     for(int i=1;i<=n;++i){
  72.         for(int j=1;j<=m;++j) cin>>mt[i][j];
  73.     }
  74.     for(int i=1;i<=n;++i){
  75.         for(int j=1;j<=m;++j) pref[i][j]=mt[i][j]+pref[i-1][j]+pref[i][j-1]-pref[i-1][j-1];
  76.     }
  77. }
  78. ll pfs[2005][2005];
  79. ll qu2mid(int x1,int y1,int x2,int y2){
  80.     return pfs[x2][y2]-pfs[x1-1][y2]-pfs[x2][y1-1]+pfs[x1-1][y1-1];
  81. }
  82. void open(){
  83.     if(fopen("mideptrai.INP","r")){
  84.         mofile("mideptrai.INP");
  85.         outfile("mideptrai.OUT");
  86.     }
  87. }
  88. char a[1005][1005];
  89. ll b[maxn];
  90. ll c[maxn];
  91. ll get(int x,int y,int u,int v){
  92.     return pfs[u][v]-pfs[u][y-1]-pfs[x-1][v]+pfs[x-1][y-1];
  93. }
  94. int main(){
  95.     fast;
  96.     int n,m,k; cin>>n>>m>>k;
  97.     for(int i=1;i<=n;++i){
  98.         for(int j=1;j<=m;++j) cin>>a[i][j];
  99.     }
  100.     for(int i=1;i<=n;++i){
  101.         for(int j=1;j<=m;++j) pfs[i][j]=pfs[i-1][j]+pfs[i][j-1]-pfs[i-1][j-1]+((int)(a[i][j]-'0'==1));
  102.     }
  103.     ll kq=0;
  104.     for(int i=1;i<=n;++i){
  105.         for(int j=1;j<=m;++j){
  106.             int v=1;
  107.             for(int u=i;u>=1;--u){
  108.                 while(v<=j && get(u,v,i,j)>k) ++v;
  109.                 if(v<=j) kq=max(kq,(i-u+1)*(j-v+1)*1ll);
  110.             }
  111.         }
  112.     }
  113.     cout<<kq<<"\n";
  114.     het;
  115. }
Success #stdin #stdout 0.01s 5636KB
comments (?)
stdin
copy 
3 3 2
100
100
001
stdout
copy 
6
https://ideone.com/GBfBYn
language:
C++ (gcc 8.3)
created:
1 day ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!