Cod sursa(job #662243)
Utilizator | Data | 16 ianuarie 2012 10:50:54 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
using namespace std;
#include<fstream>
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int main()
{
int n,i,S=0, start=1, end=1, x[6000005],max=x[1],j;
fin>>n;
for(i=1;i<=n;i++)
fin>>x[i];
for(i=1;i<=n;i++)
{
S=0;
for(j=i;j<=n;j++)
{
S=S+x[j];
if(S>max)
{
max=S;
start=i;
end=j;
}
}
}
fout<<max<<" "<<start<<" "<<end;
return 0;
}