Cod sursa(job #1618061)
| Utilizator | Data | 27 februarie 2016 17:58:57 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 90 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.51 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int v[6000005], dp[6000005], n, i, j, s, inc, inc1, sf, maxx;
int main()
{ f>>n;
for(i=1;i<=n;i++)
f>>v[i];
dp[1]=v[1];
for(i=2;i<=n;i++)
{ if(s>0) s=s+v[i];
else
{ s=v[i];
inc1=i;
}
if(s>maxx)
{ maxx=s;
inc=inc1;
sf=i;
}
}
g<<maxx<<' '<<inc<<' '<<sf;
return 0;
}
