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