Cod sursa(job #864493)
| Utilizator | Data | 25 ianuarie 2013 01:07:07 | |
|---|---|---|---|
| Problema | Operatii | Scor | 10 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.61 kb |
#include<fstream>
#include<algorithm>
using namespace std;
long long n,v[1000005],contor,maxim,start;
int main()
{
ifstream f("operatii.in");
ofstream g("operatii.out");
f>>n;
int i;
for(i=1;i<=n+1;i++)
{
f>>v[i];
if(v[i]!=0&&start==0)
start=i;
if(v[i]>maxim)
maxim=v[i];
if(v[i]==0&&start!=0)
{
contor=contor+maxim;
maxim=0;
start=0;
}
}
g<<contor;
f.close();
g.close();
return 0;
}