Cod sursa(job #2147990)
Utilizator | Data | 1 martie 2018 14:00:19 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 10 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include <iostream>
#include <fstream>
#include <climits>
using namespace std;
int main()
{
ifstream fin ("ssm.in");
ofstream fout ("ssm.out");
int n,a[100],x,y,i,j,s,bs=INT_MIN;
fin>>n;
for(i=1;i<=n;i++)
fin>>a[i];
for(j=1;j<=n;j++)
{
s=0;
for(i=j;i<=n;i++)
{
s=s+a[i];
if(s>=bs){bs=s;x=j;y=i;}
}
}
fout<<bs<<" "<<x<<" "<<y;
return 0;
}