Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<bits/stdc++.h>
- using namespace std;
- #define ll long long int
- int arr[101][101],dp[101];
- int main()
- {
- // freopen("f.txt","r",stdin);
- // freopen("g.txt","w",stdout);
- int n,gap,ans=-1;
- cin>>n;
- for(int i=1; i<=n; i++)
- {
- for(int j=1; j<=n; j++)
- {
- cin>>arr[i][j];
- arr[i][j]+=arr[i][j-1];
- }
- }
- for(int i=1;i<=n;i++)
- {
- for(int j=i;j<=n;j++)
- {
- for(int k=1;k<=n;k++)
- {
- gap=arr[k][j]-arr[k][i-1];
- dp[k]=max(gap+dp[k-1],gap);
- if(dp[k]>ans)
- ans=dp[k];
- }
- }
- }
- cout<<ans<<endl;
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement