Cod sursa(job #3198015)
| Utilizator | Data | 28 ianuarie 2024 08:51:02 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 95 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.56 kb |
#include <fstream>
using namespace std;
int n,inceput,sfarsit,i,j,maxi,sum,v[7000011],poz;
ifstream fin ("ssm.in");
ofstream fout ("ssm.out");
int main()
{
fin>>n;
for (i=1; i<=n; ++i)
fin>>v[i];
for (i=1; i<=n; ++i)
{
if (sum>=0)
sum+=v[i];
else
{
sum=v[i];
poz=i;
}
if (sum>maxi)
{
maxi=sum;
inceput=poz;
sfarsit=i;
}
}
fout<<maxi<<' '<<inceput<<' '<<sfarsit;
return 0;
}
