Pagini recente » Cod sursa (job #1580974) | Cod sursa (job #3191591) | Cod sursa (job #2938656) | Istoria paginii utilizator/burgundyshadow | Cod sursa (job #2476883)
#include <fstream>
using namespace std;
ifstream f ("ssm.in");
ofstream g ("ssm.out");
int n, v[100],s[100],mn[601],maxi,r[601],i;
int main()
{
f>>n;
f>>v[1];
s[1]=v[1];
r[1]=s[1];
/* for (i=2;i<=n;i++)
{
f>>v[i];
s[i]=s[i-1]+v[i];
mn[i]=min(s[i-1],mn[i-1]);
r[i]=s[i]-mn[i];
}
*/
/*
maxi=r[1];
for (i=2;i<=n;i++)
{
if (maxi<r[i]) maxi=r[i];
}
*/
g<<maxi;
return 0;
}