README.md

Bai 3: Doan cong dai nhat (7 diem)

Cho day A gom n so nguyen a[[1], a[2],..., an voi (1 <= n <= 10 ^5, |a[i]| <= 10^9)

Hay tim doan con gom cac phan tu lien tiep dai nhat trong day sao cho khong co hai phan tu nao co gia tri bang nhau dung canh nhau (a[i] khac a[i+1], 1 <= i < n)

Du lieu vao tu tep van ban DCDN.INP co cau truc:

• Dong dau tien chua so nguyen duong n;
• Dong tiep theo gom n so nguyen a[1], a[2],.., a[n]

Du lieu ra ghi vao tep van ban DCDN.OUT ghi mot so nguyen duy nhat la chieu dai cua doan cong dai nhat tim duoc

Cac so tren cung dong ghi cach nhau it nhat 1 dau cach.

Vi du:

DCDN.INP	DCDN.OUT
7
3 3 3 4 5 6 6	4
8
2 4 5 5 4 3 4 5	5

DCND.cpp

#include <iostream>
using namespace std;
int main()
{
    int SoPhanTuCuaMang = 8;
    int arr[SoPhanTuCuaMang] = {2,4,5,5,4,3,4,5};
    int mang[1000][1000] = {1};
    int max = 1;

    for (int i = 0; i < SoPhanTuCuaMang; i++)
    {
        for (int j = i + 1; j < SoPhanTuCuaMang; j++)
        {

            if (arr[j] != arr[j + 1])
            {
                mang[i][j] = mang[i][j - 1] + 1;
                cout << mang[i][j] << " (" << arr[j] << ") ";
                if (mang[i][j] > max)
                {
                    max = mang[i][j];
                }
            }
            else
            {
                mang[i][j] = mang[i][j - 1] + 1;
                cout << mang[i][j] << " (" << arr[j] << ") ";
                if (mang[i][j] > max)
                {
                    max = mang[i][j];
                }
                break;
            }
        }
        cout << endl;
    }
    cout << max << endl;
    return 0;
}