제출 #407006

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
407006		victoriad	Maxcomp (info1cup18_maxcomp)	C++14	0 / 100	1092 ms	332 KiB

maxcomp

#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
#include <utility>
#include <queue>
#include <map>   
#include <array>
#include <iomanip>
#include <fstream>
#include <cstdlib>
 
using namespace std;
int n,m;
vector<pair<int,pair<int,int> > >memo;

int maxi(int nodo,vector<int>&num,int hi,int lo,int c){
	if(nodo==num.size())return hi-lo-c;
	 hi=max(hi,num[nodo]);
	lo=min(lo,num[nodo]);
	return max(hi-lo-c,max(maxi(nodo+1,num,hi,lo,c+1),maxi(nodo+1,num,num[nodo],num[nodo],1)));
}


 int main(){
   ios::sync_with_stdio(false);
   cin.tie(NULL);
   int n,m;
   cin>>n>>m;
   vector<int>num(n*m);
   for(int i=0;i<n;i++){
	   for(int k=0;k<m;k++)cin>>num[i*m+k];
   }
   cout<<maxi(0,num,num[0],num[0],1);
    return 0;
 }

컴파일 시 표준 에러 (stderr) 메시지

maxcomp.cpp: In function 'int maxi(int, std::vector<int>&, int, int, int)':
maxcomp.cpp:19:9: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   19 |  if(nodo==num.size())return hi-lo-c;
      |     ~~~~^~~~~~~~~~~~

• Subtask 1: 0 / 15
• Subtask 2: 0 / 15
• Subtask 3: 0 / 30
• Subtask 4: 0 / 40