1007 正整數分組

變形的01揹包ios #include<iostream> #include<algorithm> #include<cstdio> using namespace std; int dp[10005], a[105]; int n, sum; int main(){ scanf("%d", &n); for(int i = 0; i < n; ++i) scanf("%d", &a[i]

>>阅读原文<<