Pagini recente » Cod sursa (job #2238129) | Cod sursa (job #2197218) | Cod sursa (job #1924843) | Cod sursa (job #1216447) | Cod sursa (job #671440)
Cod sursa(job #671440)
#include <iostream>
using namespace std;
int main ()
{
int a[100],i,j,n,min,bestsum;
cout<<"n=";
cin>>n;
for(i=1;i<=n;i++)
{
cout<<"a["<<i<<"]=";
cin>>a[i];
}
sum[0]=0
for(i=1;i<=n;i++)
sum[i]=a[i]+sum[i-1];
min=sum[0];
bestsum=a[1];
for(i=1;i<=n;i++)
{
best[i]=sum[i]-min;
if(min>sum[i])
min=sum[i];
if(bestsum<best[i])
bestsum=best[i];
}
cout<<bestsum;
system("pause")
return 0;
}