Cod sursa(job #1762144)
| Utilizator | Data | 23 septembrie 2016 12:46:42 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.59 kb |
#include <fstream>
#define min_int INT_MIN;
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int n,x,st,dr,sc,sum;
int main()
{
fin>>n;
int s[n+1];
s[0]=0;
for(int i=1;i<=n;i++)
{
fin>>x;
s[i]=s[i-1]+x;
}
sum = min_int;
for(int i=1;i<=n;i++)
{
for(int j=i;j<=n;j++)
{
sc=s[j]-s[i-1];
if(sum<sc)
{
sum=sc;
st=i;
dr=j;
}
}
}
fout<<sum<<' '<<st<<' '<<dr;
return 0;
}
