2019流行做什么网站网站,济南设计公司,昵图网免费素材图库官网,苏州房地产网站建设货车内宽是2.4米。考虑到最多装载#xff0c;长宽130100的货品#xff0c;应该横竖摆放。
横竖摆放的数量如何自动计算呢#xff1f;
采用数学公式#xff0c;计算如下#xff1a;
横向摆放数(int)(横长竖高)*数量/4/横长
竖向摆放数数量-横向摆放数
结果如下#x…货车内宽是2.4米。考虑到最多装载长宽130×100的货品应该横竖摆放。
横竖摆放的数量如何自动计算呢
采用数学公式计算如下
横向摆放数(int)(横长竖高)*数量/4/横长
竖向摆放数数量-横向摆放数
结果如下
横长130160竖宽10080公式横向摆放数(int)(横长竖高)*数量/4/横长数量横向摆放竖向摆放横向摆放竖向摆放10.44230810.375120.88461520.75231.32692321.125241.76923131.5352.21153831.875462.65384642.25473.09615442.625583.53846253593.98076963.3756104.42307763.757114.86538574.1257125.30769274.58135.7584.8759146.19230885.259156.63461595.62510167.0769239610177.519231106.37511187.961538116.7512198.403846117.12512208.846154127.513
非常不理想
困惑三天想的解决方法如下计算两行货物长度最小值 struct HangGeshu { public int hang1ge, hang2ge; } private HangGeshu getHengshuShuliang(int heng,int shu,int shuliang,Boolean youxianheng) { HangGeshu hangGeshu new HangGeshu(); if (shuliang 1) { hangGeshu.hang1ge shuliang / 2; if (youxianheng) { hangGeshu.hang1ge; } else { hangGeshu.hang1ge--; } hangGeshu.hang2ge shuliang - hangGeshu.hang1ge; //货物横竖摆放目标长度差值最小 (1 横放 2 竖放 int cha0 Math.Abs(hangGeshu.hang1ge * heng - hangGeshu.hang2ge * shu); int chaold cha0; Boolean key true; while (key) { cha0 Math.Abs((hangGeshu.hang1ge-1) * heng - (hangGeshu.hang2ge1) * shu); if (cha0 chaold) { chaold cha0; hangGeshu.hang1ge--; hangGeshu.hang2ge; } else { key false; } } key true; while (key) { cha0 Math.Abs((hangGeshu.hang1ge 1) * heng - (hangGeshu.hang2ge - 1) * shu); if (cha0 chaold) { chaold cha0; hangGeshu.hang1ge; hangGeshu.hang2ge--; } else { key false; } } } else { if (youxianheng) { hangGeshu.hang1ge 1; hangGeshu.hang2ge 0; } else { hangGeshu.hang1ge 0; hangGeshu.hang2ge 1; } } return hangGeshu; }
