Cod sursa(job #1174757)
| Utilizator | Data | 23 aprilie 2014 20:35:36 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.64 kb |
#include<fstream>
using namespace std;
int a[60000000];
int n,i,sol,st=1,dr=1,smax,poz;
int main()
{
ifstream fin("ssm.in");
fin>>n;
for (i=1;i<=n;i++)
fin>>a[i];
fin.close();
smax=a[1];
sol=a[1];
ofstream fout("ssm.out");
for (i=2;i<=n;i++)
{
if (smax+a[i]>=a[i])
smax+=a[i];
else {smax=a[i];poz=i;}
if (smax>sol)
{
sol=smax;
st=poz;
dr=i;
}
}
fout<<sol<<" "<<st<<" "<<dr<<"\n";
fout.close();
return 0;
}
