Cod sursa(job #2419472)
Utilizator | Data | 8 mai 2019 17:34:26 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.51 kb |
#include <fstream>
using namespace std;
const int inf=(1<<31)-1;
ifstream ci ("ssm.in");
ofstream co ("ssm.out");
int main()
{
int n,a,max=-inf-1,sum=0,h1=1,h2,t=1;
ci >> n;
for (int i=1; i<=n; i++)
{
ci >> a;
sum+=a;
if (sum>max)
{
max=sum;
h1=t;
h2=i;
}
if (sum<0)
{
sum=0;
t=i+1;
}
}
co << max << " " << h1 << " " << h2;
return 0;
}