Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <stdio.h>
- int main() {
- int N,M,P,em=0,count=0,max;
- scanf("%d %d %d",&N,&M,&P);
- int X[N][M];
- int a,d,e;
- for(int i = 0 ;i< N;i++){
- for(int j = 0 ; j < M;j++){
- X[i][j] = 0;
- }
- }
- for(int i = 0;i<P;i++){
- scanf("%d %d %d",&a,&d,&e);
- for(int j = 0;j < e;j++){
- X[a-1][d+j-1] = 1;
- }
- }
- for(int i = 0;i<N;i++){
- for(int j = 0;j < M;j++){
- if(X[i][j]==0){
- count++;
- }else if(X[i][j]==1){
- if(em<count)em = count;
- count = 0;
- }
- }if(em<count)em = count;
- count = 0;
- }
- printf("%d",em);
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement