Cod sursa(job #115222)
Utilizator | Bazu Bogdan bazub | Data | 16 decembrie 2007 11:44:51 |
---|---|---|---|
Problema | Operatii | Scor | 70 |
Compilator | cpp | Status | done |
Runda | preONI 2008, Runda 2, Clasa a 10-a | Marime | 0.55 kb |
#include<fstream.h>
long n,v[1000005],i,j,k,min,cat;
int main(){
ifstream fin("operatii.in");
ofstream fout("operatii.out");
fin>>n;
for(i=1;i<=n;i++)
fin>>v[i];
for(i=1;i<=n;i++)
while(v[i]>0){
min=v[i];
for(j=i+1;j<=n;j++){
if(v[j]==0)
break;
else if(v[j]<min)
min=v[j];
}
cat+=min;
for(k=i;k<j;k++)
v[k]-=min;
}
fout<<cat;
fin.close();
fout.close();
return 0;
}