vj1255 月饼盒

vj1255...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
//±ÉÈ˵ķ½·¨ //DP //°Ñ¶´¸³³É¸ºÎÞÇî È»ºóËã×î´ó×Ó¾ØÕó //ö¾Ù×Ó¾ØÕóµÄÁб߽ç È»ºóö¾ÙÐÐ / const maxn=300; var n,m,f,ans:longint; a,sum:array[0. .maxn,0. .maxn] of longint; procedure init; var i,j:integer; begin readln(n,m); for i:=1 to n do for j:=1 to m do begin read(a[i,j]); if a[i,j]=0 then a[i,j]:=-maxlongint div maxn;
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.
Ask a homework question - tutors are online