Question

se considera un sir de maxim 255 de caractere. realizati un program care determina cea mai lunga secventa de litere alaturate care apar in ordine alfabetica

Answer 1

#include <iostream>
#include <cstring>
using namespace std;
char s[256],v[256];
int n,i,maxi,nr;
int main()
{
    cin.get(s,255);
    n=strlen(s);
    for (i=1;i<n;i++)
    {
        if (s[i]>s[i-1])
        {
            nr=2;
            while (s[i]>s[i-1])
            {
                nr++;
                i++;
            }
            if (nr>maxi)
            {
                maxi=nr;
                strcpy(v,s+i-nr+1);
                v[nr-1]=NULL;
            }
        }
    }
    cout<<v;
}