Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- int ALGO_NAIWNY(int n, int **M){
- int x1,y1,x2,y2,x,y;
- int max=0;
- int local_max=0;
- for(x1=0;x1<n;x1++)
- for(y1=0;y1<n;y1++)
- for(x2=n-1;x2>x1-1;x2--)
- for(y2=n-1;y2>y1-1;y2--){
- local_max=0;
- for(x=x1;x<x2+1;x++)
- for(y=y1;y<y2+1;y++)
- local_max+=M[x][y];
- if ((local_max==(x2-x1+1)*(y2-y1+1)) && (local_max>max)) max=local_max;
- }
- return max;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement