Cod sursa(job #1817752)
| Utilizator | Data | 28 noiembrie 2016 13:42:48 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.62 kb |
#include <iostream>
using namespace std;
int main()
{
int S[100],n,i,j,s[100],k;
cout<<"Dati n: ";
cin>>n;
cout<<"Dati un sir de "<<n<<" numere: ";
for(i=0;i<n;i++){
cin>>S[i];
}
for(i=0;i<n;i++){
k=0;
for(j=0;j<i;j++){
k=k+S[j];
}
s[i]=k;
}
int smax=s[0],imax,jmax;
for(i=0;i<n;i++){
for(j=0;j<n;j++){
if(s[j]-s[i]>=smax){
smax=s[j]-s[i];
imax=i;
jmax=j;
}
}
}
cout<<smax<<" "<<imax<<" "<<jmax;
return 0;
}
