Cod sursa(job #2124274)
Utilizator | Data | 7 februarie 2018 08:14:57 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 85 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
#include <fstream>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int n,x,s,p1,i,maxim,p2;
int main()
{
f>>n;
f>>x;s=x;p1=1;
for(i=2;i<=n;i++)
{
f>>x;
s=s+x;
if(s>maxim){maxim=s;p2=i;}
if(s<0){s=0;p1=i+1;};
}
g<<maxim<<" "<<p1<<" "<<p2;
return 0;
}