Caso # | Resultado | Tiempo | Memoria |
---|---|---|---|
#1 |
Correcto
|
0.003 s | 3 KBi |
#2 |
Correcto
|
0.006 s | 28 KBi |
#3 |
Correcto
|
0.003 s | 2 KBi |
#4 |
Correcto
|
0.004 s | 0 KBi |
#5 |
Correcto
|
0.007 s | 1 KBi |
#6 |
Correcto
|
0.008 s | 8 KBi |
#7 |
Correcto
|
0.004 s | 0 KBi |
#8 |
Correcto
|
0.005 s | 0 KBi |
#9 |
Correcto
|
0.01 s | 38 KBi |
#10 |
Correcto
|
0.006 s | 2 KBi |
#11 |
Correcto
|
0.007 s | 2 KBi |
#12 |
Correcto
|
0.007 s | 1 KBi |
#13 |
Correcto
|
0.005 s | 0 KBi |
#14 |
Correcto
|
0.005 s | 10 KBi |
#15 |
Correcto
|
0.005 s | 2 KBi |
#16 |
Correcto
|
0.005 s | 0 KBi |
#17 |
Correcto
|
0.012 s | 1 KBi |
#18 |
Correcto
|
0.008 s | 14 KBi |
#include <algorithm> #include <bits/stdc++.h> using namespace std; typedef long long ll; typedef long double ld; typedef pair<int, int> ii; typedef vector<ii> vii; typedef vector<int> vi; typedef vector<ll> vl; #define sz(x) ((int)x.size()) #define MPI 3.14159265358979323846 #define pb push_back #define all(x) x.begin(), x.end() void __print(int x) {cerr << x;} void __print(ll x) {cerr << x;} void __print(unsigned x) {cerr << x;} void __print(unsigned long long x) {cerr << x;} void __print(float x) {cerr << x;} void __print(double x) {cerr << x;} void __print(long double x) {cerr << x;} void __print(char x) {cerr << '\'' << x << '\'';} void __print(const char *x) {cerr << '\"' << x << '\"';} void __print(const string &x) {cerr << '\"' << x << '\"';} void __print(bool x) {cerr << (x ? "true" : "false");} template<typename T, typename V> void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ','; __print(x.second); cerr << '}';} template<typename T> void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? "," : ""), __print(i); cerr << "}";} void _print() {cerr << "]\n";} template <typename T, typename... V> void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);} #ifndef Debug #define dbg(x...) cerr << "[" << #x << "] = ["; _print(x) #else #define dbg(x...) #endif void solve(){ int n, m; cin>>n>>m; vector<vector<int>>mat(n, vector<int>(m)); for(int i=0; i<n; i++){ for(int j=0; j<m; j++){ cin>>mat[i][j]; } } ll ans = INT_MIN; for(int i=0; i<n;i++){ vector<int>sum(m); for(int k=i; k<n; k++){ for(int j=0; j<m; j++){ sum[j] += mat[k][j]; } ll curr = INT_MIN; for(int j=0; j<m; j++){ curr = max(curr+sum[j],(ll) sum[j]); ans = max(ans, curr); } } } cout<<ans<<endl; } int main(){ ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); int T=1; //cin>> T; while(T--){ solve(); } return 0; }