Cod sursa(job #1999923)
Utilizator | Data | 12 iulie 2017 13:05:30 | |
---|---|---|---|
Problema | Deque | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
int v[1000],n=0,i,s,max=0;
ifstream f("date.in");
while(f>>v[n])
n++;
for(i=0;i<n;i++)
{
if(s>0)
s=s+v[i];
else
s=v[i];
if(s>max)
max=s;
}
cout<<max;
return 0;
}