Cod sursa(job #1791226)
Utilizator | Data | 29 octombrie 2016 10:57:44 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <fstream>
using namespace std;
int n,i,a[10001],sm,sc,poz1, poz2, j;
ifstream f("ssm.in");
ofstream g("ssm.out");
int main()
{
f>>n;
for(i=1;i<=n;i++)
f>>a[i];
sc=sm=a[1];
for (i=2;i<=n;i++)
{
if(sc+a[i]<a[i])
sc=a[i], j=i;
else sc+=a[i];
if(sc>sm) sm=sc, poz1=i, poz2=j;
}
g<<sm<<" "<<poz2<<" "<<poz1;
return 0;
}