fork download
  1. #include<iostream>
  2. #include<string>
  3. #include<unordered_map>
  4. #include<vector>
  5. #include<climits>
  6. using namespace std;
  7.  
  8. vector<vector<int>>dp;
  9.  
  10.  
  11. int color_mix(vector<int>ans,int i,int j){
  12. if(dp[i][j]!=-1) return dp[i][j];
  13. if(i==j) return 0;
  14. if(j==i+1) return ans[i]*ans[j];
  15. int ele=INT_MAX;
  16.  
  17. for(int k=i;k<j;k++){
  18. int f1=color_mix(ans,i,k);
  19. int f2=color_mix(ans,k+1,j);
  20. int sum_1=0;
  21. int sum_2=0;
  22.  
  23. for(int a=i;a<=k;a++) sum_1=(sum_1+ans[a])%100;
  24.  
  25. for(int b=k+1;b<=j;b++) sum_2=(sum_2+ans[b])%100;
  26.  
  27. int f3=sum_1 * sum_2;
  28. ele=min(ele,f1+f2+f3);
  29.  
  30. }
  31. return dp[i][j]=ele;
  32.  
  33. }
  34.  
  35.  
  36.  
  37. int main(){
  38. int c;
  39. cin>>c;
  40. vector<int>ans;
  41. while(c){
  42. int e;
  43. cin>>e;
  44. ans.push_back(e);
  45. c--;
  46. }
  47. int arr_size=ans.size();
  48.  
  49.  
  50. dp.assign(arr_size+1,vector<int>(arr_size+1,-1));
  51. cout<< color_mix(ans,0,arr_size-1)<<endl;
  52.  
  53. }
Success #stdin #stdout 0.01s 5324KB
stdin
2
18 19
stdout
342