RE0分,求调

P1048 [NOIP2005 普及组] 采药

@[13860121259AaBb](/user/1264600) 额你这里把n改成t ```cpp for(int i=1;i<=n;i++){ cin>>c[i]; cin>>tx[i]; } ```
by gjr0128 @ 2024-03-20 22:36:09


@[gjr0128](/user/1029795) WA0分,求调 ```cpp #include<iostream> using namespace std; int a[1001][1001]; int max(int b,int c){ if(b>c) return b; else return c; } int main(){ int c[1001]; int tx[1001]; int n,t; cin>>n>>t; for(int i=1;i<=n;i++){ cin>>c[i]; cin>>tx[i]; } for(int i=1;i<=t;i++) for(int j=1;j<=t;j++){ if(a[i-1][j]+tx[i]<=j) a[i][j]=a[i-1][j]; else a[i][j]=max(a[i-1][j],a[i-1][j-tx[i]]+c[i]); } cout<<a[n][t]; } ```
by 13860121259AaBb @ 2024-03-22 07:30:20


```cpp //重学背包吧 #include<iostream> using namespace std; int a[1001][1001]; int max(int b,int c){ if(b>c) return b; else return c; } int main(){ int c[1001]; int tx[1001]; int n,t; cin>>n>>t; for(int i=1;i<=t;i++){ cin>>c[i]; cin>>tx[i]; } for(int i=1;i<=t;i++) for(int j=0;j<=n;j++){ if(j<c[i]) a[i][j]=a[i-1][j]; else a[i][j]=max(a[i-1][j],a[i-1][j-c[i]]+tx[i]); } cout<<a[t][n]; } ```
by lieyang25 @ 2024-03-23 13:07:20


|