Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <bits/stdc++.h>
- using namespace std;
- const long long INF=1e9;
- int main(){
- int n;
- scanf("%d",&n);
- long long ar[n+1],dp[n+1];
- for(int i=1;i<=n;i++){
- scanf("%lld",&ar[i]);
- }
- long long mx=-INF;
- dp[0]=0;
- for(int i=1;i<=n;i++){
- dp[i]=ar[i];
- for(int j=1;j<i;j++){
- if(ar[j]<ar[i]) dp[i]=max(dp[i],dp[j]+ar[i]);
- }
- mx=max(dp[i],mx);
- }
- printf("%lld",mx);
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement