Pagini recente » Istoria paginii runda/eusebiu_oji_2014_cls10/clasament | Istoria paginii runda/10thgraders/clasament | Istoria paginii runda/nu_e_nimeni_in_a/clasament | Cod sursa (job #1896779) | Cod sursa (job #1772212)
#include <stdio.h>
#include <fstream>
using namespace std;
ofstream g("ssm.out");
int v[6000001],s[6000001];
FILE *f;
void read(int n){
for(int i=1;i<=n;i++)
{
fscanf(f,"%d",&v[i]);
s[i]=v[i]+s[i-1];
}
}
void solve(int n){
int sc=0,smax=0,st,dr;
for(int i=1;i<=n;i++)
for(int j=i;j<=n;j++){
sc=s[j]-s[i-1];
if(sc>smax) {
smax=sc;
st=i;
dr=j;
}
}
g<<smax<<' '<<st<<' '<<dr;
}
int main()
{
f=fopen("ssm.in" , "r");
int n;
fscanf(f,"%d",&n);
read(n);
solve(n);
return 0;
}