hihocoder1365 图片排版

思路：

模拟，枚举，dp。

参考了https://github.com/buptlxb/hihoCoder/blob/master/solutions/1365/picture_arrange.cpp

实现：

 #include <bits/stdc++.h>
 using namespace std;

 int w[], h[], dp[], m, n;

 void arrange(int w, int h, int& rw, int& rh)
 {
     if (rw >= w) { rw -= w; rh = max(rh, h); }
     else { rh = max(rh, (rw * h + w - ) / w); rw = ; }
 }

 int solve()
 {
     for (int i = n - ; i >= ; i--)
     {
         int rw = m, maxh = ;
         int j = i;
         for ( ; j < n && rw; j++)
             arrange(w[j], h[j], rw, maxh);
         dp[i] = dp[j] + maxh;
     }
     int minn = dp[], th = , rw = m, rh = ;
     for (int i = ; i < n; i++)
     {
         arrange(w[i], h[i], rw, rh);
         if (!rw) { th += rh; rw = m; rh = ; }
         int j = i + , tmpw = rw, tmph = rh;
         for ( ; j < n && tmpw; j++)
         {
             arrange(w[j], h[j], tmpw, tmph);
         }
         minn = min(minn, th + tmph + (j < n ? dp[j] : ));
     }
     return minn;
 }

 int main()
 {
     cin >> m >> n;
     for (int i = ; i < n; i++)
     {
         cin >> w[i] >> h[i];
     }
     cout << solve() << endl;
     return ;
 }