Cod sursa(job #1805649)
| Utilizator | Data | 13 noiembrie 2016 23:59:26 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.61 kb |
#include <fstream>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int n, s[6000010],jmin[6000010],x;
int main()
{
fin>>n;
for(int i=1;i<=n;i++)
{
fin>>x;
s[i]=s[i-1]+x;
if(s[jmin[i-1]]<=s[i-1])
jmin[i]=jmin[i-1];
else
jmin[i]=i-1;
}
int i=0,j=0,sol=-2147483647,sc;
for(int k=1;k<=n;k++)
{
sc=s[k]-s[jmin[k]];
if(sc>sol)
{
sol=sc;
i=jmin[k]+1;
j=k;
}
}
fout<<sol<<" "<<i<<" "<<j<<'\n';
return 0;
}
