Cod sursa(job #2313777)
| Utilizator | Data | 7 ianuarie 2019 14:23:04 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.55 kb |
#include <fstream>
#include <algorithm>
#include <iostream>
#include <cmath>
#include <bitset>
#include <string>
using namespace std;
ifstream fisierin("ssm.in");
ofstream fisierout("ssm.out");
int main()
{
int n,a,sint,smax=INT_MIN,ps,pd,pint=1;
fisierin>>n>>a;sint=a;
for (int i=2;i<=n;i++)
{
fisierin>>a;
if(sint<0)
{sint=a;pint=i;}
else
sint+=a;
if(smax<sint)
{smax=sint;ps=pint;pd=i;}
}
fisierout<<smax<<' '<<ps<<' '<<pd;
return 0;
}
