Cod sursa(job #2337015)
Utilizator | Data | 5 februarie 2019 19:45:10 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.56 kb |
#include <fstream>
using namespace std;
int main()
{
ifstream f("ssm.in");
ofstream g("ssm.out");
int n,a,s,min1,t,max1,y,i,j;
f>>n;
f>>a;
min1=a;
s=a;
max1=s;
i=1;
j=1;
t=1;
for(y=2;y<=n;y++)
{
f>>a;
s=s+a;
if(s-min1>max1)
{
max1=s-min1;
i=t+1;
j=y;
}
if(s<min1)
{
min1=s;
t=y;
}
}
g<<max1<<" "<<i<<" "<<j;
f.close();
g.close();
return 0;
}