Cod sursa(job #1313088)
Utilizator | Data | 10 ianuarie 2015 12:03:27 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 35 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <fstream>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int a[6000001], i, j,s,sm, n, b, e;
int main()
{
f>>n;
for(i=1;i<=n;i++)
f>>a[i];
for(i=1;i<=n;i++)
{ s=0;
for(j=i;j<=n;j++)
{
s+=a[j];
if (sm<s) {
sm=s; b=i; e=j;
}
}
}
g<<sm<<' '<<b<<' '<<e;
return 0;
}