Cod sursa(job #1883558)
| Utilizator | Data | 18 februarie 2017 07:33:28 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.58 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
long N, i, j, sum=0, cnt=1, st=1, dr=1, val;
int main()
{
f>>N;
long maxi=-2147483640;
for (i=1; i<=N; i++)
{
f>>val;
if(sum<0)
{
sum=val;
cnt=i;
}
else
sum=sum+val;
if(sum>maxi)
{
maxi=sum;
st=cnt;
dr=i;
}
}
g<<maxi<<" "<<st<<" "<<dr<<'\n';
f.close();
g.close();
return 0;
}
