Articolele lui Prioteasa Andrei (Quzuro)

#include <iostream>
using namespace std;

int n, v¹⁰⁰;
int max_neg(int,int v[],int );
void read(int v[], int&);
int main()
{ read(v,n); bool ok1=false; bool ok2=false; if(max_neg(n,v,-10000)==0) { cout<<” NU EXISTA VALORI STRICT NEGATIVE “; ok1=true; } if(max_neg(n,v,10000)==0) { cout<<“NU EXISTA VALORI STRICT POZITIVE “; ok2=true; } if(ok1==false) cout<<max_neg(n,v,-10000)<<” “; if(ok2==false) cout<<max_neg(n,v,10000)<<” “;

}
void read(int v[] , int &n)
{ cin>>n; for(int i=1;i<=n;++i) cin>>v[i];
}
int max_neg(int n, int v[], int maxim)
{ bool ok = false; for(int i=1;i<=n;++i) { if(maxim<0) { if(v[i]<0) { ok=true; maxim=max(maxim,v[i]); } } if(maxim>0) { if(v[i]>0) { ok=true; maxim=min(maxim,v[i]); } } } if(ok==true) return maxim; return 0;
}