Maximum number of segments of lengths a, b and c in cpp

#include <bits/stdc++.h>
using namespace std;

int maximumSegments(int n, int a,
					int b, int c)
{

	int dp[n + 1];

	memset(dp, -1, sizeof(dp));

	dp[0] = 0;

	for (int i = 0; i < n; i++)
	{
		if (dp[i] != -1) {
			

		if(i + a <= n )
				dp[i + a] = max(dp[i] + 1,
							dp[i + a]);
							
		if(i + b <= n ) 
				dp[i + b] = max(dp[i] + 1,
							dp[i + b]);
							
		if(i + c <= n )
				dp[i + c] = max(dp[i] + 1,
							dp[i + c]);
		}
	}
	return dp[n];
}


int main()
{
	int n = 7, a = 5, b = 2, c = 5;
	cout << maximumSegments(n, a, b, c);
	return 0;
}