Cod sursa(job #873495)
| Utilizator | Data | 7 februarie 2013 12:05:06 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.52 kb |
#include<fstream>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int a[60001],i,sc=-1,max1=-10000000,n,stmax,drmax,dr,st=0;
int main()
{
f>>n;
for(i=1;i<=n;i++)
f>>a[i];
for(i=1;i<=n;i++)
{
if(sc>0)
{
st=i;
sc=a[i];
}
else
sc+=a[i];
if(sc>max1)
{
max1=sc;
stmax=st;
drmax=i;
}
}
g<<max1<<" "<<stmax<<" "<<drmax;
return 0;
}
