Cod sursa(job #2649869)

Utilizator doru.nituNitu Doru Constantin doru.nitu Data 16 septembrie 2020 18:03:41
Problema Subsecventa de suma maxima Scor 0
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.69 kb
#include <fstream>
#include <queue>
using namespace std;

ifstream in("ssm.in");
ofstream g("ssm.out");

int a[6000100];

#define dim 8192
char ax[dim];
int pz;

inline void cit(int &x)
{
       x = 0;
       int ms = 1;
       while(ax[pz]  < '0' || ax[pz] > '9')
       {
         if(ax[pz] == '-') ms = -1;
         if(++pz == dim) in.read(ax,dim),pz = 0;
       }

        while(ax[pz] >= '0' && ax[pz] <= '9')
       {
              x  = x * 10 + ax[pz] - '0';
              if(++pz == dim) in.read(ax,dim),pz = 0;
       }

       x= x*ms;
}

int main()
{
    int n;
    cit(n);

    for(int i = 1; i<=n; ++i)
        cit(a[i]);

    g<<"0\n";

    return 0;
}