Advertisement
a53

mxt

a53
Nov 21st, 2017
505
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.44 KB | None | 0 0
  1. #include <iostream>
  2. #define Nmax 2001
  3. using namespace std;
  4. int n,a[Nmax],dp[Nmax][Nmax];
  5.  
  6. int main()
  7. {
  8. cin>>n;
  9. for(int i=1;i<=n;++i)
  10. cin>>a[i];
  11. for(int i=1;i<=n;++i)
  12. dp[i][i]=n*a[i];
  13. int j;
  14. for(int k=1;k<n;++k)
  15. for(int i=1;i<=n-k;++i)
  16. {
  17. j=i+k;
  18. dp[i][j]=max((n-(j-i))*a[i]+dp[i+1][j],dp[i][j-1]+(n-(j-i))*a[j]);
  19. }
  20. cout<<dp[1][n];
  21. return 0;
  22. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement