Cod sursa(job #2157905)
Utilizator | Data | 9 martie 2018 23:44:22 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.51 kb |
#include <iostream>
#include <fstream>
#include <climits>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int x,n,i1,i2,aux,s;
int main()
{
f>>n;
int smax=-INT_MAX;
int mini=0;
for(int i=1; i<=n; i++)
{
f>>x;
s=s+x;
if(s>smax)
{
smax=s;
i1=aux;
i2=i;
}
if(s<0)
{
s=0;
aux=i+1;
}
}
g<<smax<<" "<<i1<<" "<<i2;
return 0;
}