Cod sursa(job #2615932)
| Utilizator | Data | 15 mai 2020 20:51:43 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.58 kb |
#include <fstream>
#include <climits>
using namespace std;
ifstream in("ssm.in");
ofstream out("ssm.out");
int v[6000001];
int main()
{
int i,n;
in>>n;
for(i=1; i<=n; i++)
{
in>>v[i];
}
int maxim=INT_MIN,sum=0,inc,sf,aux;
for(i=1; i<=n; i++)
{
if(sum<0)
{
sum=v[i];
aux=i;
}
else
sum+=v[i];
if(sum>maxim)
{
maxim=sum;
inc=aux;
sf=i;
}
}
out<<maxim<<" "<<inc<<" "<<sf;
return 0;
}
