Cod sursa(job #2520865)
| Utilizator | Data | 9 ianuarie 2020 20:43:40 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.54 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int sum,summax=-2e9,k,Ist,Ilast,v[6000000],N;
int main()
{
f>>N;
for(int i=0 ; i<N; i++)
f>>v[i];
for(int i=0 ; i<N; i++)
{
if(sum<0)
{
sum=v[i];
k=i;
}
else
sum+=v[i];
if(summax<sum)
{
summax=sum;
Ist=k;
Ilast=i;
}
}
g<<summax<<" "<<Ist+1<<" "<<Ilast+1;
return 0;
}
