Cod sursa(job #1499301)
Utilizator | Data | 10 octombrie 2015 14:38:18 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 35 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.56 kb |
#include<iostream>
#include<fstream>
#define dx 999999999
using namespace std;
fstream fin("ssm.in",ios::in),fout("ssm.out",ios::out);
int x[6000020];
int main()
{
int i,j,n,s=0,maxi,maxj,maxim=-dx;
fin>>n;
for(i=1;i<=n;i++)fin>>x[i];
for(i=1;i<=n;i++)
{
s=0;
for(j=i;j>0;j--)
{
s+=x[j];
if(s>maxim)
{
maxim=s;
maxi=j;
maxj=i;
}
}
}
fout<<maxim<<" "<<maxi<<" "<<maxj<<"\n";
return 0;
}