Cod sursa(job #1114166)
Utilizator | Data | 21 februarie 2014 12:44:53 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.5 kb |
#include <fstream>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int i,n,s,x,p,poz,u,mi,ma=-10000000;
int main()
{
f>>n;
for (i=1;i<=n;i++)
{
f>>x;
s+=x;
if (s-mi>ma)
{
ma=s-mi;
p=poz+1;
u=i;
}
if (s<mi)
{
mi=s;
poz=i;
}
}
g<<ma<<" "<<p<<" "<<u;
f.close();
g.close();
}