Cod sursa(job #1319118)
Utilizator | Data | 16 ianuarie 2015 18:06:29 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 10 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.52 kb |
#include <iostream>
#include<fstream>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int main()
{
int a[100], n, i, j, s=0, s1=0,ic,is,l;
fin>>n;
for(i=1;i<=n;i++)
fin>>a[i];
for(i=1;i<=n;i++)
{
for(j=1;j<=i;j++)
{
l=j;
while(l<=i)
{s1+=a[l];l++;}
if(s<=s1)
{
s=s1;
ic=j;
is=i;
}
s1=0;
}
}
fout<<s<<" "<<ic<<" "<<is;
}