Cod sursa(job #2400013)
| Utilizator | Data | 8 aprilie 2019 11:31:42 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.6 kb |
#include <iostream>
#include <fstream>
#include <cmath>
using namespace std;
ifstream in("ssm.in");
ofstream out("ssm.out");
int main()
{
int n,st,dr,sum,x,smax=-9999999,drmax,stmax;
in>>n;
sum=0;
for(int i=1;i<=n;i++)
{
in>>x;
if(x>sum+x)
{
st=i;
dr=i;
sum=x;
}
else
{
dr=i;
sum=sum+x;
}
if(smax<sum)
{
stmax=st;
drmax=dr;
smax=sum;
}
}
out<<smax<<" "<<stmax<<" "<<drmax;
}
