# ACSL STRING

Question My thought Nothing… The problem is pretty easy, however it troubled me for a quite long time. Just follow the instruction of the problem and simulate the whole process by coding. Points to note * The conversion between String and int * How to handle carry * Pay attention to t

# Data Structure

ArrayList 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 // the data type must be a type of class ArrayLista = new ArrayList(); ArrayListb = new ArrayList(); // the size of the ArrayList arrayList.size(); // add data to the ArrayList arrayList.add("DATA"); // replac

# 济南Day3 坐标型动态规划及背包

## 花店橱窗布置

### 思路

• f[i][j]f[i][j]表示前i个花瓶前j个花束的最大美学价值
• f[i][j]=max(f[i−1][k],f[i][j])f[i][j]=max(f[i−1][k],f[i][j])

• 整张表都是向右下方走的，向下走加上数值，向右走无影响
• 如果向下走代表花束放入花瓶，向右走无影响代表不放入