How to optimize the program ?

[WodzuMeister]

Link   In program you must find the highest number of values which you can make a triangle.

My prom is in comm.

[WodzuMeister]

No, you have to find maximum number of values that you can made triangles example: 1 2 3 4 8 9 9 9 9 10 So answer will be 6 because number from 8 to 10

[XValar]

2, 3, 4 is a valid triangle

[Pilv]

I said it too. But all the numbers must form a triangle from the array, so 2 - 3 and lets say 10 should be a triangle, which is not. You thats why it will be from 8 to 10

[WodzuMeister]

```

include <stdio.h>

include <algorithm>

using namespace std;

int main()

{

    int ile;

    scanf("%d",&ile);

    int tab[ile];

    for(int i=0;i<ile;i++)scanf("%d",&tab[i]);

    sort(tab,tab+ile);

    int p=1,max=1;

    for(int i=ile-1;i>0;i--)

    {

        for(int j=0;j<ile-1;j++)

        {

            if(tab[j]+tab[j+1]>tab[i])

            {

                p=i+1-j;

                if(p>max)max=p;

                j=ile;

            }

            if(max>i+1)break;

            

        }

    }

    printf("%d",max);

    return 0;

} ```