Cod sursa(job #2147267)
Utilizator | Data | 28 februarie 2018 16:45:14 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 40 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.47 kb |
#include <fstream>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int n, a[100001], k, maxx=-2000000000, x, y;
int main(){
fin>>n;
for(int i=1;i<=n;i++){
fin>>a[i];
a[i]+=a[i-1];
}
for(int i=0;i<n;i++){
for(int j=i+1; j<=n; j++){
if(a[j]-a[i]>maxx){
maxx=a[j]-a[i];
x=i+1; y=j;
}
}
}
fout<<maxx<<" "<<x<<" "<<y;
}