Cod sursa(job #1896957)
| Utilizator | Data | 1 martie 2017 02:54:23 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 95 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.64 kb |
#include <fstream>
#define INF 1<<31
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int n, i, x, start, sfarsit, maxim, sf, sum, ans1, ans2, inc;
int main()
{
maxim = -INF;
inc = 0;
f>>n;
for(i=1;i<=n;i++)
{
f>>x;
if(sum+x > x)
{
sf++;
sum = sum+x;
}
else
{
sum = x;
inc = sf = i;
}
if(sum > maxim)
{
maxim = sum;
ans1 = inc;
ans2 = sf;
}
}
g<<maxim<<" "<<ans1<<" "<<ans2;
}
