Submission #18999775

---

Source Code Expand

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

#define sf scanf
#define pf printf
#define pb push_back
#define mp make_pair
#define mod 1000000007
#define IN freopen("nocross.in","r",stdin)
#define OUT freopen("nocross.out","w",stdout)
#define FOR(i,a,b) for(i=a ; i<=b ; i++)
#define DBG pf("Hi\n")
#define INF 1000000000000000000LL
#define i64 long long int
#define xx first
#define yy second
#define ln 17
#define off 2


using namespace __gnu_pbds;
using namespace std ;

typedef tree< i64, null_type, less<i64>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;

const double EPS = 1e-9 , PI = acos(-1.0);

typedef long long T ;

#define maxn 500005

int a[505] ;
int dp[505][505] ;

int main()
{
    int n ;
    int cnt = 0 ;

    scanf("%d",&n) ;

    for(int i=1 ; i<=n ; i++) scanf("%d",&a[i]) ;

    for(int l=1 ; l<=n ; l++)
    {
        for(int i=1 ; i+l-1 <=n ; i++)
        {
            int j = i+l-1 ;
            dp[i][j] = max( dp[i][j] , dp[i+1][j] ) ;
            for(int x=i+1 ; x<=j ; x+=3 )
            {
                for(int y=x+1 ; y<=j ; y+=3)
                {
                    dp[i][j] = max( dp[i][j] , a[i]+a[x]+a[y] + dp[i+1][x-1] + dp[x+1][y-1] + dp[y+1][j] ) ;
                }
            }
        }
    }

    printf("%d\n",dp[1][n]) ;

    return 0 ;
}

Submission Info

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:39:9: warning: unused variable ‘cnt’ [-Wunused-variable]
   39 |     int cnt = 0 ;
      |         ^~~
./Main.cpp:41:10: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   41 |     scanf("%d",&n) ;
      |     ~~~~~^~~~~~~~~
./Main.cpp:43:36: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   43 |     for(int i=1 ; i<=n ; i++) scanf("%d",&a[i]) ;
      |                               ~~~~~^~~~~~~~~~~~

Judge Result