Cod sursa(job #2088450)
Utilizator | Data | 15 decembrie 2017 10:58:30 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 35 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.49 kb |
#include <fstream>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int n,s[6000000],x,i,maxim,j,maxi,maxj;
int main()
{
fin>>n;
for(i=1;i<=n;i++)
{
fin>>x;
s[i]=s[i-1]+x;
}
for(i=1;i<=n-1;i++)
for(j=i+1;j<=n;j++)
if(s[j]-s[i-1]>maxim)
{
maxim=s[j]-s[i-1];
maxi=i;
maxj=j;
}
fout<<maxim<<" "<<maxi<<" "<<maxj;
return 0;
}