Cod sursa(job #2173740)
| Utilizator | Data | 16 martie 2018 00:24:12 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 35 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.73 kb |
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
ifstream in("ssm.in");
ofstream out("ssm.out");
short int N;
short int x;
int i,j,s,m,st,dr;
in>>N;
short int v[N+1][2];
v[0][0]=N;
v[0][1]=0;
for(i=1; i<=N; i++)
{
in>>v[i][0];
v[i][1]=v[i-1][1]+v[i][0];
cout<<v[i][1]<<' ';
}
st=1;
dr=1;
s=v[1][0];
m=0;
for(i=1; i<=N; i++)
{
if(m>v[i][1]){
m=v[i][1];
j=i+1;
}
if(v[i][1]-m>s){
s=v[i][1]-m;
dr=i;
st=j;
}
}
out<<s<<' '<<st<<' '<<dr;
return 0;
}
