1 solutions
-
0
C++ :
#include<bits/stdc++.h> using namespace std; int n,a[3001],b[3001],c[3001]; int main() { cin>>n; for(int i=1;i<=n;i++)cin>>a[i]; for(int i=1;i<=n;i++) { cin>>b[i]; b[i]=b[i-1]+b[i]; } for(int i=1;i<=n;i++) { c[i]=c[i-1]; for(int j=1;j<i;j++) if(a[i]==a[j]) c[i]=max(c[i],c[j-1]+b[i]-b[j-1]); } cout<<c[n]; return 0; }
- 1
Information
- ID
- 658
- Time
- 1000ms
- Memory
- 128MiB
- Difficulty
- 10
- Tags
- # Submissions
- 2
- Accepted
- 0
- Uploaded By