Cod sursa(job #1584638)
| Utilizator | Data | 30 ianuarie 2016 12:33:16 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 15 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.64 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
long long n,i,j;
int maxi,c,s,x,y;
int a[1000];
int main ()
{
f>>n;
for(i=1;i<=n;i++){
f>>a[i];
}
for(i=1;i<=n;i++){
s=a[i];
for(j=i+1;j<=n;j++){
s+=a[j];
if(s>maxi) {
maxi=s;
c++;
x=i;
y=j;
}
}
}
//cout<<maxi;
if(c==0) {
for(i=1;i<=n;i++){
if(a[i]>maxi) maxi=a[i];
}
}
g<<maxi<<" "<<x<<" "<<y;
return 0;
}
