Cod sursa(job #1517536)
Utilizator | Data | 4 noiembrie 2015 15:47:56 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.47 kb |
#include<fstream>
using namespace std;
int n, v[6000000], i, s[6000000], p, u, x;
int main()
{
ifstream f("ssm.in");
ofstream g("ssm.out");
f>>n;
for(i=1;i<=n;i++)
{
f>>x;
if(x>=s[i-1]+x)
{
s[i]=x;
p=i;
}
else {
s[i]=s[i-1]+x;
u=i-1;
}
}
f.close();
g<<s[u]-s[p-1]-1<<" "<<p<<" "<<u;
g.close();
return 0;
}