Cod sursa(job #1842249)
| Utilizator | Data | 6 ianuarie 2017 18:42:55 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.42 kb |
#include<fstream>
using namespace std;
ifstream cin("ssm.in");
ofstream cout("ssm.out");
long long n, a[6000003], s[6000003][6000003], x, y, maxi=0;
int main(){
cin>>n;
for(int i=1; i<=n; ++i){
cin>>a[i];
}
for(int i=1; i<=n; ++i){
for(int j=i; j<=n; ++j){
s[i][j]=s[i][j-1]+a[j];
if(s[i][j]>maxi){
maxi=s[i][j]; y=i; x=j;
}
}
}
cout<<maxi<<" "<<y<<" "<<x;
return 0;
}
