Cod sursa(job #1875014)
Utilizator | Data | 10 februarie 2017 17:32:43 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 85 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include <fstream>
#include <vector>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int n, s;
int sum, aux,endd, beg;
int main()
{ int i;
int bestsum=-int(2e9);
f>>n;
for(i=1;i<=n;i++)
{ f>>s;
if(sum<0)
sum=s, aux=i;
else
sum+=s;
if(bestsum<sum)
bestsum=sum,beg=aux,endd=i;
}
g<<bestsum<<' '<<aux<<' '<<endd;
}