Cod sursa(job #2163513)
Utilizator | Data | 12 martie 2018 18:35:58 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.47 kb |
#include <fstream>
#include <climits>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int n,i,x,sum,best,in,sf,k;
int main()
{
f>>n;
best=-INT_MAX;
for(i=1;i<=n;++i)
{
f>>x;
if(sum<0)
{
sum=x;
k=i;
}
else sum=sum+x;
if(sum>best)
{
best=sum;
in=k;
sf=i;
}
}
g<<best<<" "<<in<<" "<<sf;
}