Cod sursa(job #2663722)
Utilizator | Data | 27 octombrie 2020 10:01:28 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 80 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.51 kb |
#include <fstream>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int main()
{
int n;
fin>>n;
int a[n+1];
a[0]=-1;
int sol,is,id;
for(int i=1; i<=n; i++)
{
fin>>a[i];
if(0<a[i-1])
a[i]+=a[i-1];
else
{
is=i;
}
if(i==1) sol=a[1];
else if(a[i]>sol)
{
sol=a[i];
id=i;
}
}
fout<<sol<<" "<<is<<" "<<id;
return 0;
}