Cod sursa(job #2133543)
| Utilizator | Data | 17 februarie 2018 09:12:01 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 85 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.55 kb |
#include <fstream>
using namespace std;
ifstream f ("ssm.in");
ofstream g ("ssm.out");
int n,i,a[6000000],x,y,sc,smax,p,s;
int main()
{
f>>n;
for(i=1; i<=n; i++)
f>>a[i];
sc=a[1];
smax=a[1];
for(i=2; i<=n; i++)
{
if(sc<0)
{
sc=a[i];
p=i;
}
else sc+=a[i];
if(sc>smax)
{
smax=sc;
x=p;
y=i;
}
}
for(i=x; i<=y; i++)
s+=a[i];
g<<s<<" "<<x<<" "<<y<<'\n';
return 0;
}
