제출 #334130

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
334130		Kerim	Bigger segments (IZhO19_segments)	C++17	27 / 100	1567 ms	12900 KiB

segments

#include "bits/stdc++.h"
#define MAXN 100009
#define INF 1000000007
#define mp(x,y) make_pair(x,y)
#define all(v) v.begin(),v.end()
#define pb(x) push_back(x)
#define wr cout<<"----------------"<<endl;
#define ppb() pop_back()
#define tr(ii,c) for(__typeof((c).begin()) ii=(c).begin();ii!=(c).end();ii++)
#define ff first
#define ss second
#define my_little_dodge 46
#define debug(x)  cerr<< #x <<" = "<< x<<endl;
using namespace std;

typedef long long ll;
typedef pair<int,int> PII;
template<class T>bool umin(T& a,T b){if(a>b){a=b;return 1;}return 0;}
template<class T>bool umax(T& a,T b){if(a<b){a=b;return 1;}return 0;}
const int N=3004;
int dp[N][N],arr[MAXN];
ll par[MAXN];
bool vis[MAXN],ovis[MAXN];
int main(){
    //freopen("file.in", "r", stdin);
    int n,ok;
    scanf("%d",&n);
    for(int i=1;i<=n;i++){
    	scanf("%d",arr+i);
    	par[i]=par[i-1]+arr[i];
    }
    for(int i=1;i<=n;i++)
    	vis[i]=1;
    for(int j=2;j<=n;j++){
    	for(int i=j-1;i<=n;i++)
			for(int k=i+1;k<=n;k++)
				if(vis[i] and par[k]-par[i]>=par[i]-par[dp[i][j-1]])
					dp[k][j]=i,ovis[k]=1;
		ok=0;
		for(int i=j;i<=n;i++)
			vis[i]=ovis[i],ok|=vis[i],ovis[i]=0;
		if(!ok){
			printf("%d\n",j-1);	
			return 0;
		}
    }printf("%d\n",n);
	return 0;
}

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

segments.cpp: In function 'int main()':
segments.cpp:27:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   27 |     scanf("%d",&n);
      |     ~~~~~^~~~~~~~~
segments.cpp:29:11: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   29 |      scanf("%d",arr+i);
      |      ~~~~~^~~~~~~~~~~~

• Subtask 1: 13 / 13
• Subtask 2: 14 / 14
• Subtask 3: 0 / 10
• Subtask 4: 0 / 36
• Subtask 5: 0 / 27