Cod sursa(job #2753794)
Utilizator | Data | 24 mai 2021 14:19:13 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 35 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.48 kb |
#include <fstream>
using namespace std;
ifstream cin("ssm.in");
ofstream cout("ssm.out");
int n,maxim,v[100000],s,i,j,k,maxim1,maxim2;
int main()
{
cin>>n;
for(i=1; i<=n; i++)
cin>>v[i];
for(i=1; i<=n; i++){
for(j=i; j<=n; j++){
s+=v[j];
if(s>maxim){
maxim=s;
maxim1=i;
maxim2=j;
}
}
s=0;
}
cout <<maxim<<" "<<maxim1<<" "<<maxim2;
return 0;
}