lab1.2.h

#include <string>
#include <cstring>
#include <iostream>

using namespace std;

struct longsir {
    int len;
    long *sir;
    int isinitialised;};


longsir initializare (int n){
    longsir a; int i;
    a.len=n;
    a.isinitialised = 1;
    a.sir = new long[n];
    for (i=0;i<n;i++){
        cout <<"Introduceti elementul cu numarul "<<i;
        cin >>a.sir[i];}
        return a;}

longsir modlen(longsir *s, int newlen){
    if (s ->isinitialised ==1 && newlen != s->len) {
        if (newlen < s-> len) {
            longsir a;
            a.len=newlen;
            a.isinitialised=1;
            a.sir=new long[a.len];
            int i;
            for (i=0;i<newlen;i++){
                a.sir[i]=s->sir[i];};
            return a;}
        else {
            longsir a;
            int i; int oldlen=s->len;
            a.len=newlen;
            a.isinitialised=1;
            a.sir=new long[a.len];
            for (i=0;i<(s->len);i++){
                a.sir[i]=s->sir[i];};
            cout <<"Introduceti restul elementelor din sir ";
            for(i=oldlen;i>newlen;i++){
                cout <<"Introduceti elementele sirului cu numarul "<<i<<endl;
                cin.clear();
                cin >> a.sir[i];}
                return a;}}}

int remvect (longsir *s) {
    if (s -> isinitialised ==1){
        delete [] s->sir;
        s -> sir = NULL;
        s-> isinitialised =0;
        return 0;
    } else {return 1;}}

long negsum(longsir *s) {
    if (s->isinitialised==1) {
    int i; long rez=0;
    for (i=0;i<s->len;i++) {
        if (s->sir[i]<0) {
            rez += s->sir[i];}}
        return rez; }
        else {return 0;}}

long acces_longsir (longsir *s, int n){
    return s->sir[n];}