Cod sursa(job #1861682)
| Utilizator | Data | 29 ianuarie 2017 10:53:41 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 35 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.57 kb |
#include <fstream>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int n,x[6000001],i,j,S,maxim=-1,ind1,ind2;
int main()
{
fin>>n;
for(i=1;i<=n;++i)
{
fin>>x[i];
}
for(i=1;i<=n;++i)
{
x[i]+=x[i-1];
}
for(i=1;i<=n;++i)
{
for(j=i;j<=n;++j)
{
S=x[j]-x[i-1];
if(S>maxim)
{
maxim=S;
ind1=i;
ind2=j;
}
}
}
fout<<maxim<<" "<<ind1<<" "<<ind2;
return 0;
}
