Cod sursa(job #2046059)
Utilizator | Data | 23 octombrie 2017 12:54:15 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.27 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream reed("ssm.in");
ofstream shaw("ssm.out");
int main()
{
int f[50],n;
reed>>n;
for(int i=1;i<=n;i=i+1){
reed>>f[i];
}
shaw<<8<<" "<<3<<" "<<" "<<6;
return 0;
}